code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
long double PI= 3.141592653589793238463;
const int N = 1e5+5;
const int MOD = 1e9+7;
ll a[100005][5];
ll b[100005];
ll c[100005];
ll dp[100005][5];
int n,k;
void D()
{
for(int i=1;i<=n;i++){
for(int j=1;j<=3;j++){
for(int k=1;k<=... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int m, k;
cin >> m >> k;
if (m == 1) {
if (k == 0) {
cout << 0 << " " << 0 << " " << 1 << " " << 1 << endl;
}
else {
cout << -1 << endl;
}
return 0;
}
... | 0 | 25,796,655 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | #include <bits/stdc++.h>
using namespace std;
uint64_t calc_lucas(int N) {
uint64_t L[N + 1];
L[0] = 2LL;
L[1] = 1LL;
if(N == 0 || N == 1) {
return L[N];
} else if(N >= 2) {
for(int i = 2; i <= N; i++) {
L[i] = L[i - 1] + L[i - 2];
}
}
return L[N];
}
i... | 0 | 10,838,764 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int v[n];
vector<int> a[n];
for (int i = 0; i < n; i++)
cin >> v[i];
while (m--)
{
int u, v;
cin >> u >> v;
a[u - 1].push_back(v - 1);
a[v - 1].push_back(u - 1);
}
... | 0 | 1,768,387 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
using namespace std;
using ll = long long;
using ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> can_reach_from_1;
vector<int> can_reach_to_n;
vector<pair<int, int>> link;
rep(i, m) {
int a, b;
cin >> a >> b... | 0 | 78,705,402 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int h, w, k; cin >> h >> w >> k;
for(int i = 0; i <= h; i++) {
for(int j = 0; j <= w; j++) {
if(i * j + (h - i) * (w - j) == k) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MAXSIZE 10000000;
const int MAX = 510000;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
ll dp[10001][1001] ={ 0 };
int main()
{
int N;
string S;
cin >>N>>S;
int ans = 0;
for (int i = 0;... | 0 | 23,778,065 |
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcountll(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namesp... | 0 | 87,579,038 |
#include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size() ;
vector<int> alphabet(26);
for(int i=0;i<size;i++){
int num = S[i] -'a' ;
alphabet.at(num) = 1;
}
char min_char;
bool judge = f... | #include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(in... | 0 | 52,255,952 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, k;
cin >> m >> k;
if (k >= (1 << m)) {
cout << "-1\n";
return 0;
}
if (m == 1) {
if (k == 0) cout << "0 0 1 1\n";
else cout << "-1\n";
return 0;
}
cout << k << ' ';
for (int i = 0; i < (1 << m); ++i) {
if (i != k) ... | #pragma GCC optimization ("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#incl... | 0 | 16,469,053 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int I... | #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 h,w,d;
cin >>h>>w>>d;
vector<P>p(h*w);
for (int i = 0; i < h; ++i) {
for (int j = 0; j <... | 0 | 18,797,450 |
#include <iostream>
#include <string>
#include <cctype>
int main() {
const int N = 26;
int a[N] = {};
std::string str;
while(std::getline(std::cin, str)) {
for(int i = 0; str[i] != '\0'; ++i) {
if(isupper(str[i])) str[i] = tolower(str[i]);
int ch = str[i] - 'a';
if(0 <= ch && ch < N) {
... | #include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <numeric>
#include <vector>
#include <iterator>
#include <set>
using namespace std;
const double PI=acos(-1);
int main(){
long a, b, c, k, d;
cin >> a >> b >> c >> k;
if(k%2 == 0){
... | 0 | 63,218,488 |
#include <bits/stdc++.h>
#define MAX 1000000
#define MOD 1e9
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define endl '\n'
using namespace std;
#define FastInput ios_base::sy... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T... | 0 | 74,907,435 |
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define _ << ' ' <<
using namespace std;
using ll = long long;
int main()
{
int n;
string s;
int k;
cin >> n >> s >> k;
k--;
for (int i = 0; i < n; ++i)
cout << (s[i] == s[k] ? s[i] : '*');
} | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int a[300010],num2[300010],num[300010],sum_num[300010],sum_tot[300010];
int check(int m,int n)
{
int p=0;
p+= sum_num[n]-sum_num[m-1];
p+= sum_tot[m-1]/m;
return p;
}
int main()
{
int n;scanf("%d",&n);
... | 0 | 3,830,733 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(x) cout << #x << " : " << x << '\n';
const int N = 100100;
int n, k;
int h[N], dp[N];
int main() {
cin >> n >> k;
for(int i = 0; i < n; ++i)
cin >> h[i];
dp[0] = 0;
for(int i = 1; i < n; ++i) {
int j = i;
dp[i] = INT_MAX;
whi... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int i, j;
int h, w; cin >> h >> w;
bool consecutive = true;
vector<int> row_index(1, -1);
vector<vector<char>> board(h, vector<char>(w));
for (i=0; i<h; i++)
{
for (j=0; j<w; j++)
{
cin >> board.at(i).at(... | 0 | 29,749,398 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void()
#endif
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
if (n % 2) {
cout << 0 << '\n';
return 0;
}
long long ans = 0;
for (long long add = n / 10; add > 0;... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <iterator>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <map>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main() {
int n, m;... | 0 | 92,509,524 |
#include <iostream>
#include <deque>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <limits.h>
using namespace std;
int n;
int ans=0;
int main()
{
while(1)
{
ans=0;
cin >> n;
if(!n) break;
vector<string> steps(n);
int foots[]={0,0};
for(int... | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
int dfs(int u, vector<bool> seen) {
int paths = 0;
seen[u] = true;
bool all = true;
for (bool s : seen) {
if (!s) {
all = false;
break;
}
}
if (all) {
return 1;
}
for (i... | 0 | 85,334,876 |
#include <stdio.h>
int main(){
int a[4][3][10]={0},n,x,y,z,temp;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d%d%d",&x,&y,&z,&temp);
a[x-1][y-1][z-1]+=temp;
}
for(int i=0;i<4;i++){
for(int j=0;j<3;j++){
for(int k=0;k<10;k++){
printf(" %d",a[i][... | #include "bits/stdc++.h"
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define LOWER_BOUND(A, key) distance(A.begin(),... | 0 | 95,763,243 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define mp(a,b) make_pair(a,b)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
typedef long long ll;
typedef unsigned long long ull;
bool sortbysecc(const pair<int,int> &a, const pair<int,int> &b){
return (a.second < b.s... | #include <iostream>
#include <cstdint>
using namespace std;
int main() {
auto log10 = [](uint64_t n) {
int log = 0;
while (10 <= n) {
++log;
n /= 10;
}
return log;
};
auto first = [](uint64_t n) {
int last = 0;
while (n) {
l... | 0 | 82,801,589 |
#include<iostream>
#include<stdio.h>
#include<cctype>
#include<cstdio>
using namespace std;
int main(){
string num;
int sum = 0;
while(1){
cin >> num;
if(num=="0"){
break;
}
for(int i=0;i<(int)num.size();i++){
sum = sum + (int)num[i] -48 ;
}
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 24,759,469 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <c... | #include <iostream>
#include <vector>
using namespace std;
int main () {
int n;
int sum, max_sum;
while(cin >> n, n){
vector<int> a;
for(int i = 0; i < n; i++){
int temp;
cin >> temp;
a.push_back(temp);
}
max_sum = a[0];
for(int begin = 0; begin < n; begin++){
sum = 0;
... | 0 | 82,308,651 |
#include<bits/stdc++.h>
using namespace std;
int td(int n,vector<int> a)
{
vector<int> dp(n+1);
dp[1]=0;
dp[2]=abs(a[1]-a[2]);
for(int i=3;i<=n;i++)
{
dp[i]=min(abs(a[i]-a[i-1])+dp[i-1],abs(a[i]-a[i-2])+dp[i-2]);
}
return dp[n];
}
int main()
{
int n;
cin>>n;
vector<int> a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N,K;
cin >> N >> K;
int V[N];
for (int i = 0; i < N; i++) cin >> V[i];
int ans = 0;
for (int i = 0; i <= N; i++) {
for (int j = 0; j + i <= N; j++) {
int res = 0;
... | 0 | 10,711,263 |
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define PB push_back
#define MP make_p... | #include <bits/stdc++.h>
using namespace std;
vector<int>vi[100005];
const int mod = 1e9 + 7 ;
bool vis[100005];
long long dp[100005][2];
void dfs(int node){
vis[node] = 1;
long long ans1 = 1, ans2 = 1;
for(auto i : vi[node]){
if(!vis[i]){
dfs(i);
ans1 = ((ans1 * dp[i][1])... | 0 | 100,562,556 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
int a,b;
bool ok;
int ans=0;
cin>>n>>m;
int ed[n][n]={};
vector<int>v(n);
for(int i=0;i<m;i++){
cin>>a>>b;
ed[a-1][b-1]=1;
ed[b-1][a-1]=1;
}
for(int i=0;i<n;i++){
v.at(i)=i;
}
sort(v.begin(), v.end());
do{
... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
#include <queue... | 0 | 69,666,342 |
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
typedef double f32;
typedef long long i64;
const int N = 1e5+5;
int n, k; i64 v[3]; string s, t;
int main()
{
cin>>s>>k, t = s+s+s;
for(int i = 1; i < t.size(); ++i) if(t[i] == t[i-1]) t[i] = '.', ++v[i/... | #include <cstdio>
#include<iostream>
#include<map>
#include<algorithm>
#include<vector>
#include <cmath>
#include <iomanip>
#include <regex>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main(){
ll N;
cin>>N;
map <ll,ll> _mp;
for(auto i=0;i<N;i++){
ll a;cin>>a;
... | 0 | 89,649,877 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
vector<int> v(9, -1);
rep(i, 0, 9){
cin >> v[i];
}
int n;
cin >> n;
int a[n];
rep(i, 0, n){
cin >> a[i];
rep... | #include <iostream>
using namespace std;
int main()
{
int n,x,s;
while(cin >> n >> x, n+x)
{
s=0;
for(int i=1;i<n-1;++i)
for(int j=i+1; j<n;++j)
{
int k = x - i- j;
if(k>=1 && k<=n && k > i && k > j) ++s;
}
cout << s << endl;
}
return 0;
} | 0 | 92,404,342 |
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
using namespace std;
void fastio()
{
#ifndef ONLINE_JUDGE
fr... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 75,219,439 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, white, black;
cin >> n;
cin >> white;
black = n * n - white;
cout << black << endl;
} | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a <... | 0 | 87,412,976 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int count = 0;
for (int i = A; i <=B; i++) {
int a = i/10000;
int e = i%10;
int b = i/1000-i/10000*10;
int d = i/10-i/100*10;
if((a == e) && (b == d)){
count ++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s, t;
cin >> s >> t;
int m = s.length(), n = t.length(), same, ans = 0;
for(int i = 0; i <= m-n; i++)
{
same = 0... | 0 | 90,898,124 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define N 100010
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >>n>>k;
vector<int>a(n);
for(int i=0;i<n;i++)cin>>a[i];
long long kotae=LLONG_MAX;
for (int i = 0; i < (1 << n); i++) {
int bit[15];
for (int j = 0; j < n; j++){
bit[j] = (i / (1 << j)) % 2;
}
long long sa=0;
int ... | 0 | 75,178,550 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
int a[200000];
void normalize(vector<pair<int, int>> &a) {
while (a.size() >= 2) {
if (a[a.size() - 1].first == a[a.size() - 2].first) {
a[a.size() - 2].second += a[a.size() - 1].second;
a.pop_back... | 0 | 50,420,328 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 15)
cout << '+' << endl;
else if (a * b == 15)
cout << '*' << endl;
else
cout << 'x' << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fwd(i,a,n) for(int i=a;i<=n;i++)
#define bak(i,a,n) for(int i=a;i>=n;i--)
#define all(v) v.begin(),v.end()
#define pb push_back
#define lop '\n'
#define mp make_pair
typedef long long ll;
typ... | 0 | 89,909,211 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve_pat1(ll h, ll w) {
if (h % 3 == 0) {
return 0;
} else {
return w;
}
}
ll solve_pat2(ll h, ll w) {
ll b_h = h / 2;
ll ans = h * w;
for (ll i = 1; i <= w - 1; ++i) {
ll b_w = w - i;
ll area1 = i * h;
ll area2 = b_... | #include <iostream>
#include <vector>
#include <algorithm>
using lli = long long int;
using ll = long long;
lli n, m, h, a, b;
std::vector<lli> vec;
std::vector<lli> viewpoints;
int main() {
std::cin >> n >> m;
vec.assign(n+1, 0);
viewpoints.assign(n+1, -1);
for (int i = 1; i <= n; i++) {
std::c... | 0 | 62,426,240 |
#include<bits/stdc++.h>
#define ls ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define __ <<" "<<
#define case(z) "Case " << z++ << ": "
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define quit return 0
using namespace std;
void showmyDS(set<int> ds)
{
set<int... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 35,733,474 |
#include<iostream>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
char c[100][100];
for (int i=0; i<H ;i++){
for (int j=0; j<W; j++){
cin >> c[i][j];
}
}
for (int i=0; i<H; i++){
for (int n=0; n<2; n++){
for (int j=0; j<W; j++){
... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
#include<complex>
using namespace std;
void grading(int m, int f, int r){
if(m == -1 || f == -1) {cout << "F" <<endl;return;}
if(m+f >= 80... | 0 | 87,773,070 |
#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 vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | #include <iostream>
using namespace std;
int main(){
string s;cin>>s;
bool judge = false;
if (s.size() < 4){
cout << "No" << endl;
return 0;
}
if (s[0] == 'Y' && s[1] == 'A' && s[2] == 'K' && s[3] == 'I'){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
... | 0 | 72,210,547 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push
#define lld long long int
#define ins insert
#define adv advance
#define mp make_pair
#define fi first
#define se second
#define all(c) c.begin(),c.end()
#define PI 3.1415926
#define INF (lld)1e18
#define vl vector<long long int >
#... | 0 | 45,994,331 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[100005];
ll p[100005];
ll S[100005];
ll ans= 0;
int main(){
scanf("%d",&n);
for (int i = 0; i <= n; i++){
scanf("%lld",&a[i]);
}
for (int i = n; i >= 0; i--){
p[i] = p[i+1]+a[i];
}
for (int i = 0; i ... | 0 | 44,067,796 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | 0 | 56,574,583 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
ll n, ans = 0;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
vector<bool> flag(a.back()+1, true);
for(int i = 0; i < n; i++) if(flag[a[i]]) for(int j = 2*a[i]; ... | 0 | 29,837,235 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2000006;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
set<int> s;
cin>>n;
for(int i=0;i<n;i++){
int x;
cin>>x;
s.insert(x);
}
if((int)s.size() == n){
cout<<"YES";
}
else{
cout<<"NO";
}
retu... | #include<bits/stdc++.h>
using namespace std;
int lcs(string a,string b){
int c[1001][1001];
for(int i=0;i<1001;i++){
for(int j=0;j<1001;j++){
c[i][j]=0;
}
}
int m=a.size(),n=b.size();
int mx=0;
a=' '+a;
b=' '+b;
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(a[i]==... | 0 | 67,502,510 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double A,B;
cin>>A>>B;
double Amax=A+1; double Bmax=B+1;
A=A/0.08;
Amax=Amax/0.08;
B=B/0.1;
Bmax=Bmax/0.1;
double product=ceil(max(A,B));
if(product>=Amax||product>=Bmax){
cout<<"-1"<<endl;
}else{
cout<<product<<endl... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
vector<string> s(H);
for (int r = 0; r < H; r++)
{
cin >> s.at(r);
}
vector<vector<int>> dp(H, vector<int>(W, 0));
if (s.at(0).at(0) == '#')
{
dp.at(0).at(0) = 1;
}
for (int r ... | 0 | 18,396,737 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int (i)=0; (i) < (n); (i)++)
int main()
{
ll K, S; cin >> K >> S;
ll ans = 0;
for (ll x = 0; x <= K; ++x) {
for (ll y = 0; y <= K; ++y) {
ll z = S - x - y;
if (z ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=998244353;
int main(){
int n; cin>>n;
int a; cin>>a;
if(a!=0){
cout<<0<<endl;
return 0;
}
vector<ll> num(n+1,0);
ll maxnum=0;
for(int i=0;i<n-1;i++){
int x; cin>>x;
num[x]++;
maxnum=max(maxnum,ll(x));
}
... | 0 | 10,035,340 |
#include <bits/stdc++.h>
using namespace std;
const int nax = 3e5+5;
struct pair_hash {
inline long long operator()(const std::pair<int,int> & v) const {
return (long long)v.first*nax+v.second;
}
};
int main() {
int h, w, m, x, y;
unordered_set<pair<int, int>, pair_hash> set;
cin >> h >> w >> m;
... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string str1,str2;
int m[1000][1000];
int LCS(int i,int j){
if(i==-1||j==-1){
return 0;
}else if(m[i][j]!=0){
return m[i][j];
}else if(str1[i]==str2[j]){
m[i][j]=LCS(i-1,j-1)+1;
return m[i][j];
}else{
m[i][j]=max(... | 0 | 81,551,085 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
string s;cin>>s;
int cnt=1;
rep(i,n-1){
if(s[i]==s[i+1])continue;
cnt++;
}
cout<<cnt<<endl;
} | #include <iostream>
#include <vector>
#include <numeric>
using namespace std;
class Solution{
public:
int mincost(const vector<int>& nums){
int a = nums.size();
int b = -2 * accumulate(nums.begin(), nums.end(), 0);
int c = 0;
for(int e: nums) c += e * e;
int x1 = (-b) / (2 * ... | 0 | 73,190,109 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 998244353;
const double PI = 3.141592653589793;
int main(){... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int a,b;
cin >> a >> b;
if (a==1 && a!=b) cout << "Alice";
else if (b==1... | 0 | 49,567,800 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N, D;
cin >> N >> D;
vector<vector<int>> Xij(N, vector<int>(D));
for(int i=0; i<N; i++){
for(int j=0; j<D; j++){
cin >> Xij[i][j];
}
}
int count =0;
double length;
... | #include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <functional>
#define rep(i, n) for(int i = 0; i < n; ++i)
#de... | 0 | 15,743,477 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s, s2;
ll k;
cin >> s >> k;
int n = s.size();
s2 = s + s;
set<char> st;
rep(i, n) st.insert(s[i]);
if (st.size() == 1) {
cout << n * k / 2 << endl... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N;
cin >> N;
vector<P> red(... | 0 | 35,268,620 |
#include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
int main() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
int ans;
if (k == 0) {
ans = a - b;
}
else if (k == 1) {
ans =... | #include <iostream>
#include <algorithm>
#include <deque>
#include <string>
#include <utility>
#define phb push_back
#define ppf pop_front
#define mkp make_pair
#define r first
#define c second
using namespace std;
typedef pair< int, int > Pr;
const int kDir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int R, C, SR, SC;... | 0 | 25,449,070 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ln cout << endl;
#define vi vector<int>
#define vll vector<long long>
#define sortl(vec) sort(vec.begin(), vec.end());
#define sortr(vec) sort(vec.rbegin(), vec.rend());
#define ... | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define forf(i,n) for(int i=0;i<n;i++)
#define foro(i,n) for(int i=1;i<n;i++)
#define ll long long
using namespace std;
void check(int a[],int n){
ll s;
s=0;
foro(i,n){
if (a[i]-a[i-1]<0){
s+=a[i-1]-a[i];
... | 0 | 69,655,577 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> V(N+1, 0);
for (int i = 0; i <= N; i++) {
if (i==0) {
V.at(i) = 2;
}
else if (i==1) {
V.at(i) = 1;
}
else {
V.at(i) = V.at(i-1) + V.at(i-2);
}
}
cout << V.at(N) << endl;
} | 0 | 12,110,938 |
#include <iostream>
#include <algorithm>
using namespace std;
long long lcm(long long a, long long b)
{
return a / __gcd(a, b) * b;
}
int main()
{
long long A, B;
cin >> A >> B;
cout << lcm(A, B) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#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... | 0 | 68,969,549 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool... | #include<bits/stdc++.h>
#define SZ(x) ((int)x.size())
#define UNI(x) sort(ALL(x)),x.resize(unique(ALL(x))-x.begin());
#define GETPOS(c,x) (lower_bound(ALL(c),x)-c.begin())
#define GETpos(c,x) (lower_bound(ALL(c),x)-c.begin())
#define MST(x,val) memset((x),val,sizeof((x)));
#define ls rt<<1
#define rs rt<<1|1
#define ls... | 0 | 52,221,708 |
#include <iostream>
using namespace std;
int main()
{
long long N, M;
long long card;
cin >> N >> M;
if( N == 1 && M == 1 )
card = 1;
else if( N == 1 || M == 1 )
card = N*M - 2;
else
card = (N-2)*(M-2);
cout << card << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int a, b;
cin >> a >> b;
int v = 0;
for (int i = 0; i < 10005; i++) {
if ((i * 8 / 100 == a) && (i / 10 == b)) {
v = i;
break;
}
}
if (v == 0) {
... | 0 | 98,617,391 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
#define INF 1020304050
int main()
{
int n;
cin >> n;
vector<int> x(n-1);
vector<int> y(n-1);
int i;
rep(i,n-1)
{
cin >> x[i] >> y[i];
x[i]--... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
#define all(v) (v).begin(),(v).end()
#define int long long
#define P pair<int,int>
signed main() {
int n;
cin >> n;
int X = 0;
vector<tuple<int,int,int>> v;
for(int i = 0; i < n; i++)... | 0 | 31,590,308 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long int ll;
typedef pair<int, int> P;
int n, a[101010];
int main()
{
cin >> n;
rep(i, n) cin >> a[i];
int p = 0;
ll res = 0;
rep(i, n)
{
if(p && a[i])
{
p =... | 0 | 67,858,974 |
/* {:i:i:|i:i:/l/l-- --l/li:i:i|i:i:i:i}
{:rx|:i:i ィi芥ミ .ィi芥ミｉ:ｉ|ﾍ:i:i:}
. ｛ﾏ|ｉ: {::’:} {:‘::} :ｉ:i:|〉｝:/
乂|:i:| ｀¨¨¨¨´ ｀¨¨¨´ :i:ｉ:|ｼ/
ﾉ:|:i| ′ |:i:i:|ﾂ
/:/|:i:| ､ _ _ |:i:i:|
/:/ .|:i:|/ ＼ ｨ〔|:i:/
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
int n , m;
cin >> n >> m;
vi acc(n + 1);
... | 0 | 90,480,470 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, K;
cin >> A >> B >> C >> K;
if (K <= A) return cout << K << "\n", 0;
if (K <= A + B) return cout << A << "\n", 0;
cout << A - (K - A - B) << "\n";
} | #include<bits/stdc++.h>
using namespace std;
template <typename T> inline void readline(T &n) {n = 0; int f = 1; register int ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') f = -1;for (; isdigit(ch);
ch = getchar()) n = (n << 3) + (n << 1) + ch - '0';n = n * f;}
template <typename T, typename TT>... | 0 | 11,148,341 |
#include <cstdio>
#define MAXN 200005
char s[MAXN];
int cnt[MAXN];
int main() {
using ll = long long;
int n, p;
ll res = 0;
scanf("%d%d%s", &n, &p, s);
if (p == 2 || p == 5) {
for (int i = 0; s[i]; ++i)
if ((s[i] - 48) % p == 0) res += i + 1;
} else {
int t = 0, x = 1;
for (int i = n - 1; ... | #include <iostream>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<Int>;
using VVI = vector<vector<Int> >;
int in_rec(VVI& v, int n, int target, VI check_table) {
Int ret = 0;
Int size = v[target].size();
check_table[target] = 1;
... | 0 | 77,879,681 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repR(i,a,b)for(int i=a;i>=b;i--)
#define repA(i, a, n) for(int i = a; i <= (n); ++i)
#define all(x) x.begin(), x.end()
#define vec vector<int>
#define... | #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 = 1e9 + 7;
#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++)
#de... | 0 | 77,447,638 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<cstring>
#include<set>
#include<queue>
#include<map>
#include<math.h>
#define FASTREAD ios_base::sync_with_stdio(0);cin.tie(nullptr);
#define ll long long
#define dd double
#define scl(n) scanf("%lld",&n)
#define scd(n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < n / 2; i++) {
if (s[i] == s[i + n / 2]) {
ans++;
}
}
if (n % 2 == 1) {
cout << "No" << endl;
} e... | 0 | 71,742,064 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
string s;
cin>>n>>s;
for(int p=0;p<4;++p){
string t(n,'?');
t[0]=a=(p%2?'S':'W');
t[1]=b=(p/2%2?'S':'W');
for(int i=1;i<=n;++i){
int prev=(i%n==0?n-1:i-1);
int next=(i==n-1?0:i%n+1);
if((s[i%n]=='o'&&t[i%n]=='S... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
rep(i, n) sort(s.at(i).begin(), s.at(i).end());
sort(s.begin(), s.end());
ll cnt = 1;
ll ans = 0;
rep(i, n-1){
if(... | 0 | 39,559,498 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
ll a,b,c;
cin>>a>>b>>c;
if(a==b&&b==c){
cout<<1<<endl;
}else if(a==b||b==c||a==c){
cout<<2<<endl;
}else{
cout<<3<<endl;
}
r... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<numeric>
#include<climits>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class A, class B> inline bool chmax(A &a, const B &b) { return b ... | 0 | 21,486,840 |
#include <iostream>
#include <cmath>
#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>
#inclu... | #include<bits/stdc++.h>
using namespace std;
#define PI acos(-1)
#define INF 100000000
#define sc(n) scanf("%d",&n);
#define ssc(n) scanf("%s",n);
#define lsc(n) scanf("%lld",&n);
#define dsc(n) scanf("%lf",&n);
#define csc(n) scanf("%c",&n);
#define LL long long int... | 0 | 10,199,759 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
ll n, m, ans;
vector<pii> dt;
int main() {
cin >> n >> m;
for (ll i = 0; i < n; i++) {
ll x; cin >> x;
dt.pb({x, 0});
}
for (l... | #include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <math.h>
#include <complex>
using namespace std;
typedef long long int ll;
typedef complex<long double> Point;
typedef vector<Point> Polygon;
const long double eps=1e-9;
namespace std{
bool operator<(const Point &p,const Point &... | 0 | 95,689,620 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a,b;
int main()
{
scanf("%lld%lld%lld",&n,&a,&b);
if(a>b||(n<2&&a!=b))
{
puts("0");
return 0;
}
n-=2;
printf("%lld\n",n*b-n*a+1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rrep(i,n) for (int i = 1; i <= (n); i++)
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i,1000) {
string t;
... | 0 | 2,740,149 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+5;
int n , k;
int ar[N];
int cnt[N];
int main(){
int dif = 0;
scanf("%d%d" , &n , &k);
for(int i = 1; i <= n; i++){
scanf("%d" , &ar[i]);
if(cnt[ar[i]] == 0)
dif ++;
cnt[ar[i]]++;
}
... | #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);
}
int min = *min_element(A.begin(), A.end());
int max = *max_element(A.begin(), A.end());
int a = 0;
while (min != max)
{
... | 0 | 35,125,885 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 93,430,307 |
#include<bits/stdc++.h>
#define M_PI 3.14159265358979323846
#define Speed_UP ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)x.size()
#warning Remeber to change t
using namespace std;
typedef long long ll;
inline vo... | #include<bits/stdc++.h>
using namespace std;
main() {
#ifdef HOME
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, x;
cin >> n;
vector < int > a;
for (int i = 1; i <= 2 * n; ++i) {
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
int ans ... | 0 | 3,717,797 |
#include <cstdio>
#include <algorithm>
int main(void){
int i,j,k,n,p[101], m[101][101];
scanf("%d", &n);
for(i=0;i<n;i++){
scanf("%d %d", &p[i], &p[i+1]);
}
for(i=n-2;i>=0;i--){
m[i+1][i+1] = 0;
for(j=i+1;j<n;j++){
m[i][j] = p[i]*p[i+1]*p[j+1] + m[i+1][j];
for(k=i+1;k<j;k++){
m[i][j] = std::min(m[i... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define S second
#define F first
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define input_from_file freopen("input.txt", "r", stdin);
using namespace std::chrono;
int main(){ fastIO
ll n;ci... | 0 | 42,820,492 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
int main(){
string s;
cin >> s;
if(s[0]==s[1] && s[1]!=s[2] && s[2]==s[3])cout << "Yes" << endl;
else if(s[0]==s[2] && s[1]!=s[2] && s[3]==s[1])cout << "Yes" << endl;
else if(s[0]==s[3] &... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... | 0 | 55,376,037 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = (long long)... | #include <iostream>
#include <string>
using namespace std;
string s;
int main(){
cin>>s;
if(s.size()<=25){
int a[26]={};
for(int i=0;i<s.size();i++)a[s[i]-'a']=1;
cout<<s;
for(int i=0;i<26;i++){
if(a[i]==0){
cout<<char('a'+i);
return 0;... | 0 | 87,129,326 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define nl cout<<"\n";
#define chk(x) cout<<#x<<" : "<<x, nl
#define ll long long int
#define vi vect... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#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;
constexpr int MOD = 1... | 0 | 25,134,645 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
string s;
ll cnt[26]={0};
cin>>s;
rep(i,s.length()){
cnt[s[i]-'a']++;
}
rep(i,26){
if(cnt[i]>1){
cout<<"no"<<endl;
re... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define re... | 0 | 55,808,199 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long n;
cin>>n;
vector<string> w(n);
map<string,long long> m;
f(i,0,n){
cin>>w[i];
m[w[i]]++;
}
bool f=true;
f(i,0,n-1){
if(w[i][w[i].size()-1]!=w[i+1][0]){
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | 0 | 31,521,798 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #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;
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<int>alo(N);
rep(i, 0, N){
if (S[i] == 'R') alo[i]... | 0 | 8,410,625 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int t = 0;
int h = 0;
int n;
string str1, str2;
cin >>n;
for(int i = 0; i<n; i++){
cin >>str1 >>str2;
if(str1 == str2){
t += 1;
h += 1;
}else if(str1 > str2){
t += 3... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp ... | 0 | 35,751,316 |
#include <bits/stdc++.h>
#include <unordered_map>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=... | #include<bits/stdc++.h>
using namespace std;
vector<int>g[200010];
int ans[100010];
bool vis[100010];
void bfs(int rt)
{
vis[rt]=1;
queue<int>q;
q.push(rt);
while(!q.empty())
{
int adj=q.front(); q.pop();
for(auto x: g[adj])
{
if(vis[x]==0)
{
... | 0 | 5,629,009 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
string C;
for (cin >> H >> W; H; H--) {
cin >> C;
cout << C << endl << C << endl;
}
} | #include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 2e5 + 7;
const double eps = 1e-9;
const long double pi = 3.1415926535897932384626433... | 0 | 64,782,478 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define out(a) cout<<a<<" "
#define all(a) (a).begin(), (a).end()
#define upper_index(v, a) (int)distance(v.begin(), upper_bound((v).begin(), (v).end(), a))
#define lower_index(v, a) (int)distance(v.begin(), lower_bound((v).beg... | 0 | 61,437,914 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
int main() {
int N;
cin >> N;
int cnt=0, cnta=0, cntb=0, cntn=0;
for... | #include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
char s[200100];
int n,ans=1,num;
int main(){
int i,j,k;
scanf("%d",&n);
scanf("%s",s);
for(i=0;i<2*n;i++)
if(!(((s[i]=='W')^num)&1))
num++;
else{
ans=1ll*ans*num%mod;
num--;
}
... | 0 | 73,362,178 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
string S;
cin >> S;
if (S == "A"){
cout << "T" << endl;
}
else if (S == "T")
{
cout << "A" << endl;
}
else if (S == "G")
{
c... | #include<iostream>
#include<climits>
using namespace std;
int dp[1000001][4];
int a[1000001];
int b[1000001];
int c[1000001];
int solve(int n)
{
dp[1][0]=a[1];
dp[1][1]=b[1];
dp[1][2]=c[1];
for(int i=2;i<=n;i++)
{
dp[i][0]=a[i]+max(dp[i-1][1],dp[i-1][2]);
dp[i][1]=b[i]+max(dp[i-1]... | 0 | 100,522,848 |
#include <map>
#include <iostream>
#include <string>
using namespace std;
int main()
{
map<char, char> mp;
char a,b,c;
string x;
int n;
cin >> n;
do{
mp.clear();
x.clear();
do{
cin >> a >> b;
mp[a] = b;
} while (--n);
cin >> n;
do{
cin >> c;
if (mp[c] != NULL) {
x += mp[c];
}
el... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
int n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; ++i)
{
cin >> a[i];
}
ll... | 0 | 64,822,445 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
ll vs[100000+10];
ll xs[100000+10];
int main(void) {
int n;
scanf("%d", &n);
ll X = 0;
... | 0 | 78,798,661 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
const int NIL = -1;
const int M =1046527;
const int L = 14;
char H[M][L];
int getChar(char ch){
if(ch=='A') return 1;
else if(ch=='C') return 2;
else if(ch=='G') return 3;
else if(ch=='T') return 4;
else return 0;
}
long long getKey(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | 0 | 66,234,497 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
vector<vector<int>>cnt(n,vector<int>(26,0));
for (int i = 0; i < n;... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 29,531,741 |
#include<iostream>
using namespace std;
int main(void)
{
int a,b,x; cin>>a>>b>>x;
if((a<=x)&&(x<=(a+b))){puts("YES");}
else{puts("NO");}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
int main() {
ll N, M;
cin >> N >> M;
char A[50][50];
char B[50][50];
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
cin >> A[i]... | 0 | 15,123,152 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, L, R;
double count = 0, ans = 0;
pair<double, double> P[100];
map<double, double> mpL, mpR, mp;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P[i].first;
count += P[i].first;
if (i != 0) P[i].first += P[i - 1].first;
}
for (int i = 0; i < ... | #include <iostream>
using namespace std;
int main() {
int num1, num2, num3;
cin >> num1 >> num2 >> num3;
if (num1 < num2) {
if (num2 < num3) {
cout << "Yes\n";
}
else {
cout << "No\n";
}
}
else {
cout << "No\n";
}
return 0;
} | 0 | 45,459,193 |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#define vi vector<int>
#define vpii vector<pii>
#define pii pair<int, int >
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define LL long long
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define al... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
while(cin >> n,n){
string str[n];
for(int i=0; i<n; ++i){
cin >> str[i];
}
bool state = false;
int ans = 0;
for(int i=0; i<n-1; ++i){
if(!state){
if(str[i] == "lu" && str[i+1] == "ru"){
... | 0 | 25,978,223 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 11,262,065 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 53,533,002 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define numrep(i,n) for(int i=1;i<=n;i++)
#define bitrep(n) for(int bit=0;bit<(1<<n);bit++)
#define ll int64_t
#define all(v) v.begin(), v.end()
const int MOD = 1000000007;
int main() {
ll N,ans; cin>>N;
set<ll> S;
S.insert(N);
for(int ... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int N, K;
cin >> N >> K;
vector<int> P(N), C(N);
for (int i = 0; i < N; i++)
{
cin >> P[i];
P[i]--;
}
for (int i = 0; i < N; i++)
{
cin >> C[i];
}
long long ans = LONG_LONG_MIN;
for (int i = ... | 0 | 45,461,478 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(ll i=0;i<n;i++)
#define reps(i,n) for(ll i=0;i<=n;i++)
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
const ll dx[8] = {1, 1, 0... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
typedef complex<double> xy_t;
const double eps = 1e-11;
double x[4], y[4];
int n;
double dot_product(xy_t a, xy_t b)
{
return (conj(a) * b).real();
}
double cross_product(xy_t a, xy_t b)
{
return (c... | 0 | 47,401,891 |
#include <stdio.h>
#include <string.h>
int main (){
char a[3][35];
int length [3];
for (int i = 0;i<3;i++){
scanf ("%s", a[i]);
length[i]=strlen(a[i]);
}
if(a[0][length[0]-1]== a[1][0] &&a[1][length[1]-1]==a[2][0]){
printf("YES");
}else{
printf("NO");
}
return 0;
} | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int do_stuff(int n)
{
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
int max_so_far = 0;
int max_ending_here = 0;
for (int i = 0; i < n; ++i) {
int curr = a[i];
max_ending... | 0 | 85,734,237 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
const int mod=1e9+7;
auto mul=[&](int a,int b){return 1LL*a*b%mod;};
auto fail=[](){cout<<"0\n";exit(0);};
int n;
string s;
cin>>n>>s;
if(s[0]=='W')fail();
if(s[2*n-1]=='W')fail();
vector<char... | 0 | 2,271,787 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
while (N >= 2) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define LOOP(i, N) for (int i = 1; i <= (int)N; i++)
#define RREP(i, N) for (int i =(int)N-1; i >= 0; i--)
#define RLOOP(i, N) for (int i =(int)N; i > 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define AL... | 0 | 77,034,998 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <ctime>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | 0 | 52,403,232 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector <int> x(N);
vector <int> y(M);
for (int i = 0; i < N; i++) cin >> x.at(i);
for (int i = 0; i < M; i++) cin >> y.at(i);
sort (x.begin(),x.end());
sort (y.begin(),y.end());
int y_min = y.at(0);
... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include<complex>
using namespace std;
int par[200010];
int unifind(int n) {
for (int i = 0; i < n; i++) {
... | 0 | 67,790,630 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulin... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);++i)
typedef long long int ll;
using namespace std;
int main(void) {
int m, nmin, nmax;
int p[201];
while(cin >> m >> nmin >> nmax && m) {
REP(i, m) cin >> p[i];
sort(p, p+m, g... | 0 | 18,272,717 |
#include <iostream>
using namespace std;
int main (int argc, char **argv) {
int *a;
int n;
cin >> n;
a = new int[n];
for (int i=0; i<n; i++) {
cin >> a[i];
}
int min = 1000001;
int max = -1000001;
long sum = 0;
for (int i=0; i<n; i++) {
if (a[i] < min) min = a[i];
if (a[i] > max) max = a... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 54,581,283 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
cin >> a;
int c = 0;
if(a[1] == a[2]){
if(a[3] == a[0]){
c = 1;
if(a[0] == a[1]){
c = 0;
}
}
}
if(a[1] == a[0]){
if(a[3] == a[2]){
c = 1;
... | #include<bits/stdc++.h>
using namespace std;
#include<vector>
namespace Union_find {
class union_find {
int n;
std::vector<int> par;
std::vector<int> rank;
std::vector<int> _size;
public:
union_find(int _n);
int find(int x);
void unite(int x, int y);
bool same(int x, int y) { return ... | 0 | 52,676,305 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>
using namespace st... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
string k;
int main(){
cin>>k;
set<ll>kl;
for(char c:k) kl.insert(c);
for(ll ia = 'a';ia<=ll('z');ia++) if(!kl.count(char(ia))){cout<<char(ia)<<'\n';return 0;}
cout<<"None\n";
} | 0 | 13,124,669 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.