code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | #include<iostream>
#include<cmath>
using namespace std;
char A[20][20];
bool V[20][20];
int count,H,W;
void check(int x,int y){
if(0<=x-1){
if(A[x-1][y]=='.'&&!V[x-1][y]){
count++;
V[x-1][y]=true;
check(x-1,y);
}
}
if(x+1<H){
if(A[x+1][y]=='.'&&!V[... | 0 | 14,374,547 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n; cin >> n;
vector<vector<int>> a(n,vector<int>(n,0));
for(int i=0;i<n;i++){
int u,k; cin >> u >> k;
if(k==0) continue;
for(int j=0;j<k;j++){
int v; cin >> v;
... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | 0 | 8,357,501 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int q; cin >> q;
while(q--) {
ll a, b; cin >> a >> b;
if(a > b) swap(a, b);
if(a == b || a + 1 == b) {
cout << 2 * a - 2 << endl;
} else {
ll c = sqrt(a * b);
if(c... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 29,144,676 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define... | #include <iostream>
#include <map>
using namespace std;
#define ll long long
ll H,W,N,ans[10],y,x,dy[9]={-1,-1,-1,0,0,0,1,1,1},dx[9]={0,1,2,0,1,2,0,1,2};
map<ll,ll> chk;
int main()
{
cin >> H >> W >> N;
ans[0]=(H-2)*(W-2);
for(int i=0; i<N; i++)
{
cin >> y >> x;
map<ll,ll> c;
for(int j=0; j<9; j++)
{
ll... | 0 | 9,070,490 |
#include <iostream>
using namespace std;
int main()
{
double t,x,res;
cin>>t>>x;
res=t/x;
cout<<res;
} | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 51,605,695 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int main... | #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 ll long long
#define pp pair<ll,ll>
#define ppp pair<ll,pp >
#define trace(...) cout<<"Line:"<<__LINE__<<" "; __f(#__VA_ARGS__, __VA_ARGS__)
template<typename ... | 0 | 11,267,858 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 10000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007;
int main(){
int A,B;cin>>A>>B;
vector<vector<char>> S(100,vector<char>(100,'.'));
for(int i=50;i<100;i++){
for(int j=0;j<100;j++){
S[i][j]='#';
}
... | 0 | 81,826,352 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX=1001001;
const ll MOD=1000000007;
int main()
{
ll h, w, a, b;
cin >> h>>w>>a >> b;
vector<vecto... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
string s[n];
vector<string> v;
for (int i = 0; i < n; i++)
{
cin >> s[i];
v.push_back(s[i]);
}
int m;
cin >> m;
string t[m];
for (int i = 0; i < m; i++)
{
cin >> t[i];
... | 0 | 59,579,753 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int a,b;
cin>>a>>b;
cout<<a*a-b<<endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define e... | 0 | 51,240,409 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 35,875,926 |
#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(... | #include <bits/stdc++.h>
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 chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 93,078,614 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <iostream>
using namespace std;
int main(void){
int n = 0, m = 0, p = 0;
while(cin >> n >> m >> p){
if(n == 0){
break;
}
int allG = 0;
int plaier[100];
for(int i = 0; i < 100; i++){
plaier[i] = 0;
}
for(int i = 0; i < n; i+... | 0 | 57,998,281 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;
int n, a[1005], b[1005];
int main()
{
scanf("%d", &n);
rep(i, n) s... | #include<iostream>
#include<string>
#include<string.h>
#include<map>
#include<set>
#include<vector>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#define pb push_back
#define ll long long
#define mp make_pair
#define rep(i,n) for(int i=0;i<n;i++)
#define re return
#define fi first
#define se se... | 0 | 92,309,697 |
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define all(v) v.begin(),v.end()
#define ll long long int
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define D1(x) {cerr<<" [" <<#x<<": "<<x<<"]";cout << endl;}
#define D2(x) {cerr<<" [" <<#x<<": ";f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int n;
string s;
cin >> n >> s;
vector<vector<bool>> l(n, vector<bool>(10, false)),r(n, vector<bool>(10, false));
for(int i = 1; i < n-1; i++) {
l[i]=l[i-1];
... | 0 | 47,703,845 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7;
int main() {
string l;
cin >> l;
int n = l.size();
ll dp[2][n];
for (int i = 0; i < 2; i++) {
for (int k = 0; k < n; k++) {
dp[i][k] = 0;
}
}
dp[0][0] = 1;
dp[1][0] = 2... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin>> N >> M;
vector<string> S(N+1, "TLE");
int ac_cnt = 0;
int wa_cnt = 0;
vector<int> WA(N+1, 0);
for(int i=0; i<M; i++){
int p;
string s;
cin>>p;
cin>>s;
if(S[p] == "AC"){continue;}
... | 0 | 37,487,663 |
#include<iostream>
using namespace std;
int main(){
int x,y;
cin>>x>>y;
if(x<y){
cout<<0;
}
else{
cout<<10;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
int A[N];
int B[N];
for(int i = 0; i < N; i++){
cin >> A[i];
B[i] = A[i];
}
sort(B,B + N);
int max_v =... | 0 | 36,857,019 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
int t = 1900*m + 100*(n-m);
cout << t * pow(2,m);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(A) (A).begin(), (A).end()
int main(){
ll N, M;
cin >> N >> M;
vector<pl... | 0 | 54,807,694 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
double dis(double xa,double ya,double xb,double yb){
return sqrt((xa-xb)*(xa-xb)+(ya-yb)*(ya-yb));
}
int m... | #include<bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define MP make_pair
#define test cout<<"test"<<endl;
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9+7;
const ll INF = 1e... | 0 | 79,356,670 |
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 2000000 + 5;
const int maxm = 10000 + 5;
int n;
int A[maxn],B[maxn],C[maxm];
void Counting_Sort(int left,int right){
for(int i = left;i <= right; i++)C[A[i]]++;
for(int i = 1;i <= maxm; i++)C[i] += C[i-1];
for(int i = left;i <= right; i++){
... | #include <iostream>
#include <string>
using namespace std;
int main(){
string data,data_copy;
int m, h;
for (;;){
cin >> data;
if (data == "-")break;
data_copy = data;
cin >> m;
for (int i = 0; i < m; i++){
cin >> h;
for (int j = 0; j < data.length(); j++){
if ((j + 1 - h) <= 0){
data[data.l... | 0 | 75,156,092 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
int main()
{
ll n;
cin >> n;
ll ar[n];
for(int i=0;i<n;i++) cin >> ar[i];
sort(ar,ar+n);
ll i=n-1,a=0,b=0;
for(;i>=1;i--)
{
if(ar[i]==ar[i-1])
... | #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>
#inclu... | 0 | 51,146,698 |
#include<iostream>
using namespace std;;
int main() {
int n;
while (cin >> n) {
int i, j, p;
p = 0;
bool isprime[1000000];
for (i = 0; i <= n; i++) {
isprime[i] = true;
}
isprime[0] = false;
isprime[1] = false;
for (j = 2; j <= n; j++) {
if (isprime[j]) {
for (i = 2; i*j <= n; i++) {
i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 0 | 30,430,337 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | #include<cstdio>
#include<iostream>
#include<sstream>
#include<cctype>
using namespace std;
int n2d(const char *s) {
int res=0;
char c;
int last=1;
while(c=*s++) {
int w;
switch(c) {
case 'm':
w = 1000;
break;
case 'c':
... | 0 | 88,771,834 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1e5+5;
int k;
string s;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin >> k >> s;
if(s.size() <= k)
cout << s << endl;
else
{
for(int i = 0; i < s.size(); i++)
if(i == k - 1)
{
cout << s[i];
b... | #include <iostream>
#include <bits/stdc++.h>
#include <set>
using namespace std;
int n;
pair<int,int> ps[100005];
bool cmp(const pair<int,int>&a,const pair<int,int>&b)
{
return a.first > b.first;
}
int main()
{
set<int> ss;
scanf("%d",&n);
for(int i=0;i<n;++i){
scanf("%d",&ps[i].first);
... | 0 | 46,427,883 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin >> N >> A;
N *= N;
B = N - A;
cout << B << endl;
} | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 0 | 38,661,379 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define rep2(i, startValue, N) for (int i = (int)(startValue); i < (int)(N); ++i)
#define REP(type, name, beginValue, endCondValue) \
for (type name = beginValue; name < endCondValue; ++name)
#define VECTOR_DIM3(T, name... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, n;
while (true) {
cin >> h >> w >> n;
if (h + w == 0) return 0;
int sheet[20][20] = {};
while (n--) {
int x, y;
cin >> x >> y;
sheet[x][y] = 1;
}
int dp[20][20... | 0 | 58,534,154 |
#include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
string s;
ci... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#defin... | 0 | 6,687,526 |
#include<iostream>
using namespace std;
int main(){
char s[100000]={'3'};
cin>>s;
int a=0,b=0;
for(int i=0;i<100000;i++){
if(i%2==0){
if(s[i]=='1'){
a++;
}
}
else{
if(s[i]=='0'){
a++;
}
}
... | #include<iostream>
#include<algorithm>
#include<stdio.h>
#include<cstdio>
#include<vector>
using namespace std;
int a[233333];
int b[233333];
long long ans;
vector<int> v;
int sum;
int main(){
int n;
cin>>n;
sum=n;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
ci... | 0 | 43,235,088 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int n;
cin >> n;
cout << (n-2)*180 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define vll vector<long long>
#define mll map<long long,long long>
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a>b)?b:a)
#define pb push_back
#define prll pair<long long,long long>
typedef long long ll;
typedef long double ld;
#define rep(i,a,n) for(ll i=a; i<n; i++)
... | 0 | 60,492,755 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int h, w; cin >> h >> w;
vector<vector<char> > s(h, vector<char>(w));
REP(i, h) REP(j, w)
cin >> s[i][j];
vector<vector<int> > dp(h, vector<int>(w, INT_MAX));
dp[0][0] = (s[0][0] == '#');
REP(i, h) REP(j, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main(){
ll n,m; cin>>n>>m;
vector<pair<ll, ll>> v(n);
rep(i,n){
cin>>v.at(i).first>>v.at(i).second;
}
sort(v.begin(),v.end());
ll i=0,ans=0;
while(tru... | 0 | 49,663,672 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define INF LLONG_MAX
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp... | 0 | 58,778,465 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,-1,0};
int dy[4]={1,0,0,-1};
long double eps = 1e-6;
lo... | 0 | 91,689,218 |
#include<iostream>
using namespace std;
int main(){
int n;
int a;
int min=1000000;
int max=-1000000;
long long sum=0;
cin >> n;
for(int i=1;i<=n;i++){
cin >> a;
sum=sum+a;
if(a<min){
min=a;
}
if(a>max){
max=a;
}
}
cout << min << " " << max << " " << sum << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<... | 0 | 10,790,235 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ty... | #include<iostream>
using namespace std;
void Insert(int);
void Increase(int,int);
int Extract(void);
void maxHeapify(int i);
int H[1000000];
int n=0;
int main(){
int key,n=0;
char ch[10];
while(1){
cin>>ch;
if(ch[0]=='i'){
cin>>key;
Insert(key);
}
else if(ch[0]=='e' && ch[1]=='x'){
... | 0 | 6,341,865 |
#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>
#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 make_pair
#define pii pair<int,int>
#defi... | 0 | 52,860,956 |
#include<bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define mp make_pair
#define PI acos(-1)
using namespace std;
map<ll,ll>cnt;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll i,j,k,x,y,z,m,n,t,a,b,c,l,r,q;
cin>>k>>n;
for(i=1; i<=n; i++)
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 24,188,997 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
ll func2(ll *p, ll *q, ll *r, int A, int B, int C, int X, int Y)
{
ll ans(0);
ll max;
int i(0);
int x = X, y = Y, a = A, b = B, c = C;
while (i++ < X + Y)
{
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
int N; cin >> N;
vector<int> cs(N - 1), ... | 0 | 2,353,116 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
bool check = true;
int n;
int arr[100005];
long long color=1, yeah[100005];
cin >>n;
for(int i=1; i<=n; i++){
cin >> arr[i];
}
yeah[0]=0;
sort(arr+1, arr+1+n);
for(int i=1; i<=n; i++){
yeah[... | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
long long int make(long long int a,long long int b){
long long int result=b/3;
long long int rem=b%3;
long long int r1=result,r2=result,r3=result;
if(rem>=1){
r2++;
}
if(rem>=2){
r3++;
}
long long in... | 0 | 23,457,692 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <iostream>
#include <cstdio>
#define MAX 100005
#define NIL -1
using namespace std;
struct Node {
int parent;
int left;
int right;
};
Node Tree[MAX];
int D[MAX];
void print(int u) {
printf("node %d: ",u);
printf("parent = %d, ",Tree[u].parent);
printf("depth = %d, ",D[u]);
if (Tree[... | 0 | 62,915,991 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
for(int i = 1; ; i++) {
int x;
cin >> x;
if(x == 0) break;
cout << "Case " << i << ": " << x << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; (i) < ((int)(n)); ++(i))
int main() {
ll ans = 0;
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
rep(i, N) {
ans += min(A[i], B[i]);
... | 0 | 3,137,220 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i... | #include <bits/stdc++.h>
using namespace std;
void warshall_floyd(const int n,
vector<vector<int64_t>>& cost) {
for (auto i = 0; i < n; i++) cost[i][i] = 0;
for (auto k = 0; k < n; k++) {
for (auto i = 0; i < n; i++) {
for (auto j = 0; j < n; j++) {
cost[i... | 0 | 19,040,450 |
#include <iostream>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
namespace IO {
template <typename TYPE>
class TableIO {
public:
static vector<vector<TYPE> > MakeTable();
static vector<vector<TYPE> > MakeT... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#define PB push_back
#define pii pair<int,int>
#define fir first
#define sec second
#define ll long long
#define MP make_pair
using namespace std;
template <class T>
inline void rd(T &x) {
x=0; char c=getchar(); int f=1;
w... | 0 | 40,690,927 |
#include <iostream>
#include <vector>
int INF = 1e9;
int main(){
int n;
std::cin >> n;
std::vector<int> g(n), re(n);
for(int i = 0; i < n; i++) std::cin >> g[i] >> re[i];
int dp[n + 1][n + 1];
for(int i = 0; i < n + 1; i++){
for(int j = 0; j < n + 1; j++) dp[i][j] = INF;
if(i < n... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
... | 0 | 58,963,448 |
#include<iostream>
#include<algorithm>
using namespace std;
int Time[100005];
int main(){
int N, C, K, ans = 0;
cin >> N >> C >> K;
for(int i=1; i<=N; i++){
cin >> Time[i] ;
}
sort(Time + 1, Time + N + 1);
for(int i=1; i<=N; i++){
ans++;
int temp = i;
for(int j=te... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
int P[N];
ll where[N];
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> P[i];
P[i]--;
where[P[i]] = i;
}
set<int> Set;
Set.insert(-1);
Set.inse... | 0 | 2,820,660 |
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define llmax LLONG_MAX
#define llmin LLONG_MIN
#define imax INT_MAX
#define imin INT_MIN
#define pb push_back
int n,paths=0,ans=0;
void dfsRec(vector<int>adj[],int s, bool visited[])
{
int count=0;
for(int i=0;i<n;i... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> P;... | 0 | 85,723,878 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, mod = 1e9 + 7;
int main()
{
int n, m, c = 0, x;
map<int, ll> mp;
mp[0]++;
cin >> n >> m;
while (n--)
cin >> x,
c += x,
c %= m,
mp[c]++;
ll ans = 0;
for (auto it: mp)
... | #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);... | 0 | 51,923,474 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){... | #include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int)(r);... | 0 | 7,641,664 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n, h;
cin >> n >> h;
vector<int> a(n), b(n);
for (int i=0; i<n; i++){
cin >> a[i] >> b[i];
}
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
int ans = 0;
int sum = 0;
for (int i=0; i<n; i++){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ve vector
int main(){
string s;
cin >> s;
int ans=0,memo=0;
int now = 0;
int n = s.size();
rep(i,n){
if(s[i]-'0' != now) ans++;
n... | 0 | 51,574,274 |
#include <bits/stdc++.h>
using namespace std;
int main () {
string s;
cin >> s;
string a = "";
vector<int> v;
int k = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != 'x') {
a += s[i];
v.push_back(k);
k = 0;
}
else {
k++;... | #include <iostream>
using namespace std;
int digitsum(int n){
int sum=0;
while(n){
int rem= n%10;
sum+=rem;
n/=10;
}
return sum;
}
int main(void){
int n;
cin>>n;
int a,b;
cin>>a>>b;
int sum =0;
for(int i=1;i<=n;i++){
int dsum=digitsum(i);
if(dsum>... | 0 | 45,757,920 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX;
#define INFL LLONG_MAX;
typedef long long ll;
using namespace std;
int main(){
int x,a; cin >> x >> a;
if(x < a) puts("0");
els... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | 0 | 48,653,087 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
int main(){
while(1){
int n,a,b,c,x; cin >> n >> a >> b >> c >> x;
if (n + a + b + c + x == 0)break;
vector<int> rand(n);
for (int i = 0; i < n; i++){
cin >> rand[i];
}
int look = 0;
int ans = 0;
for (int i = 0; i <= 10000; i+... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=100006;
int a[maxn];
int f[maxn][36];
int main()
{
int n;
scanf("%d",&n);
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
int l;
scanf("%d",&l);
int q;
scanf("%d",&q);
for(int i=1;i<=n;i++)
{
... | 0 | 48,130,117 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
cin >> S;
reverse(S.begin(), S.end());
while(true){
int N = S.size();
if(N < 5){
if(N == 0){
cout << "YES" << endl;
return 0;
}else{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &e : A) cin >> e;
vector<int> sieve(1000001);
for (int i = 0; i < 1000001; i++) sieve[i] = i;
for (int i = 2; i < 1000; i++) {
if (sieve[i] != i) continue;
for (int j = 2; i*j < 1000001; j++) si... | 0 | 59,542,182 |
#include<bits/stdc++.h>
#define ff first
#define ss second
#define len(x) (int)(x.size())
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define MAXN 100010
#define MAXLOGN 20
#define comp(a, b) max((a), (b))
int st[MAXN][MAXLOGN];
void init(int* bg, int*en){
in... | #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; ... | 0 | 25,040,422 |
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll n;
vector<ll> p;
int main() {
cin >> n;
for (ll i=2; i*i<=n; i++) {
if (n % i == 0) {
ll e = 0;
while (n % i == 0) {
e++;
n /= i;
}
p.push_back(e);
}
}
if (n != 1)
p.push_back(1);
ll ans = 0;
for (ll x : ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 | 50,016,869 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define fr(i,n) for(i=0;i<n;i++)
#define F first
#define S second
#define fast std::ios_base::sync_with_stdio(false)
#define mod 1000000007
#define pi 3.14159265
int main() {
fast;
l... | #include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0;i < (n);i++)
#define repr(i, n) for(int i = (n);i >= 0;i--)
#define repf(i, m, n) for(int i ... | 0 | 58,571,284 |
#include <iostream>
#include <vector>
#define int long long
#define MAXN 200000
int a[MAXN];
int n;
std::vector<int> Adj[MAXN];
int dfs(int u, int p = -1) {
int ret = a[u];
if(Adj[u].size() == 1 && p != -1)
return ret;
int sum = 0;
int max = 0;
for(int j : Adj[u]) {
if(j == p)
continue;
int ... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 57,260,933 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> vec(H,vector<char> (W));
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cin >> vec.at(i).at(j);
}
}
for(int i=0;i<H;++i){
for(int j=0;j<W;++j){
cout << vec.at(i).at(j);
}
cout... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db long double
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define mi map<int,int>
#define ml map<ll,ll>
#define mii map<pii,int>
#define fi first
#define se second
#define ... | 0 | 34,825,010 |
#include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main() {
string s ;
cin >> s ;
int res = 0 ;
rep(i,4){
... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt... | 0 | 55,035,551 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B;
cin >> A >> B;
if (A == 1 && B == 1) {
cout << "Draw" << endl;
} else if (A == 1) {
cout << "Alice" << endl;
} else if ... | #include <bits/stdc++.h>
using namespace std;
const int MAXH = 30;
const int MAXW = 30;
int W, H;
char G[MAXH][MAXW];
int dfs(int x, int y) {
const static int dx[] = {1,0,-1,0};
const static int dy[] = {0,1,0,-1};
G[y][x] = '#';
int res = 1;
for(int k = 0; k < 4; ++k) {
int nx = x + dx[k];
int ny = y ... | 0 | 39,600,855 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n, x;
bool a[105];
int main() {
cin >> x >> n;
for (int i=0; i<n; i++) {
int t; cin >> t; a[t]=1;
}
int d=0;
while (true) {
if (!a[x-d]) {cout << x-d; return 0;}
if (!a[x+d]) {cout << x+d; return 0;}
d++;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, K;
cin >> A >> B >> K;
int result = 1;
int count = K;
for (int i=max(A, B); i>1; i--)
{
if (A%i==0 && B%i==0)
{
count -= 1;
if (count==0)
{
result = i;
... | 0 | 48,972,092 |
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#define pb push_back
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int M = 1000000007;
ll mod(ll x){
return ((x%M + M)%M);
}
ll add(ll a, ll b){
return mod(mod(a)+mod(b));
}
ll mul(ll a, ll b){
return mod(mod(a)*mod(b));
}
ll minu(ll a, ll b){
return mod(mod(a)-mod(b));
... | 0 | 89,357,839 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
t... | #include <iostream>
using namespace std;
typedef long long ll;
const ll C = 5e8;
const int MAX_N = 2e4 + 5;
ll target [MAX_N];
ll A [MAX_N];
ll B [MAX_N];
int main () {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int pi;
cin >> pi;
target[pi] = 2 * C + i;
}
A[n +... | 0 | 45,108,045 |
#include <iostream>
using namespace std;
int main() {
string s, str;
cin >> s >> str;
int a, b;
cin >> a >> b;
string u;
cin >> u;
if(u == s)
--a;
else
--b;
cout << a << ' ' << b;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string key[10]={"0",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int n;
cin>>n;
for (int nn=0;nn<n;nn++){
string in;
vector<int> input;
string ans;
cin>>in;
for (int i=0;i<in.length();i++)... | 0 | 83,249,394 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,a;
cin >> N;
a=0;
for(int i=0;i<N;i++){
a+=(i+1);
}
cout << a <<endl;
} | #include<iostream>
#include<string>
using namespace std;
int main(){
string n;
cin >> n;
for(int i=0; i<3; i++){
if(n.at(i) == '1'){
cout << '9';
}else{
cout << '1';
}
}
cout << endl;
return 0;
} | 0 | 8,496,111 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
map<long long, long long> prime_factor(long long n) {
map<long long,... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n) && n){
char prev[3] = "xy";
char now[3];
int ans = 0;
for (int i = 0; i < n; i++){
scanf("%s", now);
if (now[0] != prev[0] && now[1] == prev[1]) ans++;
str... | 0 | 25,005,270 |
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1000000007;
int main()
{
int n, k, a[5003];
cin >> n >> k;
int least = INF;
for(int i = 0; i < n; i++){
cin >> a[i];
if(a[i] >= k) least = min(least, a[i]);
}
sort(a, a + n, greater<int>());
int dp[... | #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);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n; int a[n];
int ans = 100000; int total = 0;int total1 = 0;
... | 0 | 98,323,979 |
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
#include <queue>
#include <iomanip>
#include <string>
#include <algorithm>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep_1 (i,j,n) for(int i=j;i<n;i++)
typedef long long ll;
typedef long l;
const ll ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for(long long int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(long long int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000
#define LLINF 1000000000000000000
#define PI 3.14159265358979
using namespace std;
typedef long long int ll;
typedef pair< long long... | 0 | 43,847,370 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, T;
cin >> N >> X >> T;
auto cdiv = [&](auto a, auto b) {
return (a + b - 1) / b;
};
cout << cdiv(N, X) * T << "\n";
} | #include <bits/stdc++.h>
#define ALL(A) (A).begin(),(A).end()
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
const ll mod = 1e9+7;
const ll INF = -1*((1LL<<63)+1);
const int inf = -1*((1<<31)+1);
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N ;
vec... | 0 | 99,754,101 |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<numeric>
#include<cctype>
#include<random>
#include<bitset>
using nam... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int h, n;
cin >> h >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
vector<ll> dp(h + 1, INT32_MAX);
dp[0] = 0;
for (int i =... | 0 | 65,285,901 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N, H; cin >> N >> H;
int a[N], b[N];... | #include <iostream>
using namespace std;
int l[2000][2000], r[2000][2000], up[2000][2000], down[2000][2000];
char a[2000][2000];
int main () {
int h, w, temp = 0, res = 0;
cin >> h >> w;
for (int i = 0; i < h; i++) for (int j = 0; j < w; j++) cin >> a[i][j];
for (int i = 0; i < h; i++) {
temp = ... | 0 | 39,933,744 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll n,m; cin >> n >> m;
cout << n*m - m - n + 1;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (ll i = 0; i < (n); i++)
typedef pair<int, int> P;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main(){
ll n, m;
cin >> n >> m;
vector<vector<ll>> jobs(m);
rep(i,n){
ll a,b... | 0 | 57,349,123 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for... | 0 | 46,626,135 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int H, W;
cin >> H >> W ;
while(H!=0 || W!=0){
for (int h = 0; h< H; h++){
for ( int w = 0; w < W; w++){
cout << '#';
}
cout << endl;
}
cou... | #include<iostream>
#include<map>
using namespace std;
int main(){
map<char,int> m;
for(int i=0;i<4;i++){
char c;
cin>>c;
m[c]++;
}
for(auto p : m){
if(p.second==2&&m.size()==2){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} | 0 | 70,382,202 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll,ll> lll;
const ll MOD = 1000000007;
const ll INF = 1e9+5;
const double eps = 1e-7;
cons... | #include<bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define rep(i,a,b) for(i=a;i<b;i++)
#define all(v) v.begin(),v.end()
#de... | 0 | 32,560,740 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n,m,i,j;
string s,t;
cin >> s >> t;
n=s.size();
m=t.size();
for(i=n-m;i>=0;i--){
for(j=0;j<m;j++)
if(t[j]!=s[i+j] && s[i+j]!='?')
break;
if(j==m)
break;
}
if(i<0){
cout << "UNRESTORABLE" << endl;
... | #include<iostream>
using namespace std;
#define MAX 100005
#define NIL -1
struct Node
{
int parent, left, right;
};
Node node[MAX];
int n, depth[MAX];
void print(int u)
{
int i, c;
cout << "node " << u << ": ";
cout << "parent = " << node[u].parent << ", ";
cout << "depth = " << depth[u] << ", ";
... | 0 | 41,271,761 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
#define pll pair<ll, ll>
#define pii pair<int, int>
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vpii vector<pair<int, int>>
#define mems(x, y) memset(x, y, sizeof(x))
#define all(x) (x).begin(), (x).e... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
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 chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | 0 | 63,832,339 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define INT(str) stoi((str), 0)
#define INTB(str) stoi((str), 0, 2)
int main() {
int a, b;
cin >> a >> b;
if (b < a) {
int t = a;
a = b;
b = ... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int MAX_K = 1e3;
int main(){
int N; scanf("%d", &N);
if( N == 1){
printf("%s\n", "Yes");
printf("%d\n", 2);
printf("%d %d\n", 1, 1);
printf("%d %d\n", 1, 1); return 0;
}
int k = 0;
for(i... | 0 | 58,438,461 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
REP(i, N) cin >> S[i];
int result = 0;
REP(A, N) {
function<char(int, int)> T = [&](int i, int j) {
... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | 0 | 77,122,374 |
#include <bits/stdc++.h>
using namespace std;
int main () {
map<int, int> m;
for (int i = 0; i < 6; i++) {
int a;
cin >> a;
if (++m[a] > 2) {
puts("NO");
return 0;
}
}
puts("YES");
} | #include <cassert>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inc... | 0 | 67,816,137 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> s(m);
vector<int> p(m);
rep(i, m)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i... | 0 | 29,997,936 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> P;
constexpr int INF = 1e9;
constexpr int MOD = 1e9+7;
int main() {
ll a,b,c,d;
cin >> a >> b >> c >> d;
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 0 | 78,666,315 |
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RRE... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int n, k;
cin >> n >> k;
vector<double> pos(20);
pos[0] = 1.0;
for (int i = 1; i < 20; ++i)
pos[i] = pos[i - 1] / 2;
const double p ... | 0 | 20,557,626 |
#include <bits/stdc++.h>
#define rep(i,a,n) for (int i = a; i < (int)(n); i++)
#define ll long long
#define INF 1e17
using namespace std;
int main() {
int N,M; cin >> N >> M;
ll a[N],b[N],c[M],d[M];
rep(i,0,N) cin >> a[i] >> b[i];
rep(i,0,M) cin >> c[i] >> d[i];
rep(i,0,N) {
ll ans =INF;
int num;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=j; i<=k; i++)
#define FFOR(i, j, k) for(int i=j; i<k; i++)
#define DFOR(i, j, k) for(int i=j; i>=k; i--)
#define bug(x) cerr<<#x<<" = "<<x<<'\n'
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
template <... | 0 | 54,629,733 |
#include <iostream>
using namespace std;
#define NIL -1
#define MAX 100005
class Tree{
private:
struct Node{
int parent, left, right;
};
public:
Node node[MAX];
int depth[MAX];
void setDepth(int u, int p);
void printNodeInf(int u);
};
void Tree::setDepth(int u, int p){
depth[u] = p;
if(node[u].right... | #include <bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef long long ll;
int main(){
int N,M;
cin >> N >> M;
vi h(N+1);
for(int ... | 0 | 17,046,882 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 10000... | #include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
int main(){
int K;
cin >> K;
vector<int> A(K);
for (int i = 0; i < K; i++){
cin >> A[i];
}
long long tv1 = INF;
long long fv1 = 0;
while (tv1 - fv1 > 1){
long long mid = (tv1 + fv1) / 2;
long long N = mid;
... | 0 | 99,911,048 |
#include <iostream>
#include <vector>
using namespace std;
bool getResult(int redNum, int greenNum, int blueNum, int count){
if(count == 0) return ((redNum < greenNum) && (greenNum < blueNum));
bool result;
result = getResult(redNum * 2, greenNum, blueNum, count - 1);
if(result) return result;
result = getRes... | #include <bits/stdc++.h>
#define ll long long
#define _ ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
using namespace std;
int main() { _
int n, m, z, ans = 0; cin >> n >> m >> z;
char arr[6][6];
set <int> row, col;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
... | 0 | 93,422,809 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#include <stack>
#define rep(i, n) for(... | 0 | 19,876,012 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | 0 | 42,104,811 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll kabu = 0;
ll ans = 1000;
for (int i = 0; i < n; i++) {
if (i == n-1) ... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | 0 | 26,236,854 |
#include<bits/stdc++.h>
using namespace std;
int fa[100005],k[100005];
int f(int u)
{
if(u==fa[u])
return u;
else
{
int t=f(fa[u]);
k[u]+=k[fa[u]];
return fa[u]=t;
}
}
int main()
{
int i,l,r,d,p,q,n,m;
cin>>n>>m;
for(i=1;i<=n;i++)
{
fa[i]=i;
k[i]=0;
}
for(i=1;i<=m;i++)
{
cin>>l>>r>>d;
if(f(l... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int nxt[20][100000], rev[20][100000];
void construct(vector<int> &v, int l, int c[20][100000]){
int n = v.size();
for(int i = 0; i+1 < n; i++){
c[0][i] = upper_bound(v.begin(),v.end(),v[i]+l)-v.begin()-1;
}
c[0][n-1] = ... | 0 | 74,918,478 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans;
string s;
bool l,r,c;
while(1){
cin>>n;
if(n==0) break;
l=r=false;
c=true;
ans=0;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu") l=true;
else if(s=="ld") l=false;
else if(s=="ru") r=true;
else if... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,d=0;
string c;
cin>>a>>c>>b;
if(c[0]=='+')
{
d=a+b;
}
else
{
d=a-b;
}
cout<<d<<endl;
return 0;
} | 0 | 90,885,241 |
#include <iostream>
#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>
#inc... | #include<iostream>
#include<cstdio>
#include<algorithm>
#define INFTY (1>>30)
using namespace std;
int H,heap[2000001];
void maxHeapify(int i){
int l,r,largest;
l=i*2;
r=i*2+1;
if(l<=H&&heap[l]>heap[i]) largest=l;
else largest=i;
if(r<=H&&heap[r]>heap[largest]) largest=r;
if(largest!=... | 0 | 77,129,884 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | #include<algorithm>
#include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
bool isKaibun(string s) {
string rev = s;
reverse(rev.begin(), rev.end());
return s == rev;
}
int main(void) {
string S;
cin >> S;
string ans = "Yes";
if (!isKaibun(S)) ans ="No";
if (!isKaibun(S.substr(0, (S.length() ... | 0 | 8,497,176 |
#include <iostream>
using namespace std ;
int main()
{
int A , B , C ;
cin >> A >> B >> C ;
if (A >= -100 && C <=100)
{
if (A == B)
cout << C ;
if (B == C)
cout << A ;
if (A == C)
cout << B ;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 99,993,721 |
#include<iostream>
using namespace std;
int n,s,cnt;
void dfs(int m,int num,int sum);
int main(){
while(cin>>n>>s,n || s){
cnt=0;
dfs(1,0,0);
cout<<cnt<<endl;
}
return 0;
}
void dfs(int m,int num,int sum){
if(m>9 && (num==n || num==n-1) && sum==s)cnt++;
if(m>9)return;
dfs(m+1,num+1,sum+m);
dfs(m+1,num,sum)... | #include <bits/stdc++.h>
using namespace std;
int main(){
string str,tar;
cin >> str >> tar;
bool flag=false;
for(int i=0;i<str.length();i++){
if(str[i]==tar[0]){
flag=true;
for(int j=0;j<tar.length();j++){
int pos=(i+j)%str.length();
if(str[pos]!=tar[j]){
flag=false;
break;
}
}
... | 0 | 97,302,617 |
#include <bits/stdc++.h>
using namespace std;
using u64 = uint64_t;
using s64 = int64_t;
int main() {
u64 N, X, M;
cin >> N >> X >> M;
if(N < M) {
u64 ans = 0;
for(u64 i=0; i<N; i++) {
ans = ans + X;
X = (X * X) % M;
}
cout << ans << endl;
return 0;
}
vector<bool> l(M);
u64 lsum = 0;
u64 nX = X;
... | #include<bits/stdc++.h>
using namespace std;
map<int,int> Map;
signed main(void){
ios::sync_with_stdio(false);
int x,maxn=0;
while(cin>>x)
Map[x]++;
for(map<int,int>::iterator it=Map.begin();it!=Map.end();it++)
maxn=max(maxn,it->second);
for(map<int,int>::iterator it=Map.begin();it!=Map.end();it++)
if(it->se... | 0 | 69,613,800 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
char ch;
int num[26] = {0};
while(scanf("%c", &ch) != EOF){
if(ch >= 'A' && ch <= 'Z'){
ch += 'a' - 'A';
num[ch - 'a']++;
}else if(ch >= 'a' && ch <= 'z'){
num[ch - 'a']++;
}
}
for(int i = 0; i < 26; i++){
cout << (char)(i + 'a... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long n,i,step=0;
cin >> n;
long a[n];
cin >> a[0];
for(i=1; i<n; i++){
cin >> a[i];
if(a[i] < a[i-1]){
step += a[i-1]-a[i];
a[i] += a[i-1]-a[i];
}
}
cout << step << endl;
} | 0 | 4,724,837 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,count=0;
cin >> N;
for(int i=0;i<N;i++){
int A=log10(i+1)+1;
if(A%2==1){
count++;
}
}
cout << count << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
std::string s, p;
std::getline( cin, s );
std::getline( cin, p );
std::string::size_type i, j;
for( i = 0; i < s.size(); ++i ){
for( j = 0; j < p.size(); ++j){
if( s[(i + j) % s.size()] != p[j] )
break;
if( j == p.size() - 1){
... | 0 | 46,351,184 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | 0 | 45,499,359 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
set<char>st;
st.insert(s[0]);
st.insert(s[1]);
st.insert(s[2]);
st.insert(s[3]);
if(st.size()==2)
cout<<"Yes";
else
cout<<"No";
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e4 + 5;
int A[N], B[N], P[N], n;
main() {
cin >> n;
for(int i = 1; i <= n; ++ i) scanf("%lld", &P[i]);
for(int i = 1; i <= n; ++ i) A[i] = B[n - i + 1] = N * i;
for(int i = 1; i <= n; ++ i)
A[P[i]] += i;
for(int i = 1; i <= n; ++ ... | 0 | 34,241,541 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 68,592,730 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.