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;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<x<<endl
#define mmax(x... | #include <cstring>
#include <map>
#include <unordered_map>
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
using namespace std;
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
t... | 0 | 35,547,531 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
#define long ll
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll n;
while(cin >> n) {
if(!n) break;
vector<ll> a(n);
for(auto &e: a) cin >> e;
ll r = 1e9;
sort(a.begin(), a.end());
... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
string g;
rep(i,s.length()){
if(s[i]=='B') {
if(g.length()>0) g.pop_back();
... | 0 | 39,140,896 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
char data[2*h][w];
for(int i=0;i<2*h;i+=2){
for(int j=0;j<w;j++){
cin >> data[i][j];
data[i+1][j]=data[i][j];
}
}
for(int i=0;i<2*h;i++){
for(int j=0;j<w;j++){
cout << data[i][j];
}
cout <... | #include<iostream>
using namespace std;
int main() {
int time[5];
int ans = 0;
int last_dish;
int last_dish_time = 0;
int fixed_time[5];
for (int i = 0; i < 5; i++) {
cin >> time[i];
}
for (int i = 0; i < 5; i++) {
if (time[i] % 10 == 0) {
fixed_time[i] = time... | 0 | 54,841,043 |
#include <iostream>
#include <algorithm>
using namespace std;
#define relu(x) max(x, 0l)
int main() {
int n, k;
cin >> n >> k;
long a[n], rui[n+1], top[n+1];
for (auto &ai:a) cin >> ai;
rui[0] = top[0] = 0;
for (int i=0; i<n; i++) {
rui[i+1] = rui[i] + a[i];
top[i+1] = top[i] + r... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 31,245,421 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1001001001;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
if (n >= k) {
ans += (n / k) * (n / k) * (n / k);
}
if (k % 2 == 0) {
ll mod... | #include <iostream>
using namespace std;
#include <string>
#include <cctype>
int main() {
int pTarou = 0, pHanako = 0, n;
string sTarou, sHanako;
cin >> n;
for (int i = 0; i < n; i++){
cin >> sTarou >> sHanako;
if (sTarou > sHanako) pTarou += 3;
else if (sTarou < sHanako) pHanako... | 0 | 59,007,046 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
using namespace std;
typedef long long ll;
int main(){
char in[500];
int ans_max=0,ans_long=0;
string s_max,s_long;
map<stri... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int, int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;... | 0 | 100,344,000 |
#include <bits/stdc++.h>
#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++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include<bits/stdc++.h>
using namespace std;
#define lli int long long
#define ull unsigned long long
#define ld long double
#define pi acos(-1)
#define pb push_back
#define pbk pop_back
#def... | 0 | 71,008,538 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string s, p;
cin >>s;
cin >>p;
s+=s;
if(s.find(p)==-1){
cout <<"No" <<endl;
}else{
cout <<"Yes" <<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
char pre_char;
int count = 1;
cin >> pre_char;
for(int i = 1; i < n; i++){
char c;
cin >> c;
if(pre_char != c) count++;
pre_char = c;
}
cout << count << endl;
} | 0 | 30,138,045 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | #include <iostream>
#include <algorithm>
#define MAXN 100
#define WHITE 0
#define BLACK 1
using namespace std;
int D[MAXN][MAXN];
bool judge ( int color, int i, int j)
{
if ( i-1 >= 0 && j-1 >= 0 && D[i-1][j-1] == color ) return false;
if ( i-1 >= 0 && D[i-1][j] == color ) return false;
if ( i-1 >= 0 && j+1 < MAX... | 0 | 19,472,986 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
using P = pair<ll, ll>;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
using Graph... | #include <iostream>
using namespace std;
int main()
{
int n,i,j,judge = 0;
cin >> n;
string s[n];
for(i = 0; i < n; i ++)
cin >> s[i];
for(i = 1; i < n; i ++)
{
if(s[i][0] == s[i - 1][s[i - 1].size() - 1])
judge ++;
else
{
judge = 0;
... | 0 | 41,125,341 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int INF = numeric_limits<int>::max();
const ll LLINF = numeric_limits<ll>::max();
const double PI = acos(-1.0);
#define rep(i, ... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
using ll = long long;
ll X, Y, A, B ,C;
ll P[110000];
ll Q[110000];
ll R[110000];
int main(void){
cin >> X >> Y >> A >> B >> C;
for (int i = 0; i < A;i++) cin >> P[i];
for (int i = 0; i < B;i++) cin >> Q[i];
for (int i = 0; i <... | 0 | 55,449,032 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1e5+5;
int a[maxn];
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)cin>>a[i];
sort(a+1,a+n+1);
int sum=0;
for(int i=1;i<=m;i++){
sum+=a[i];
}
... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 100,255,176 |
#include <iostream>
using namespace std;
int main(void){
string c;
cin>>c;
printf("%c", (c[0]+1));
} | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 0 | 42,502,076 |
#include<bits/stdc++.h>
using namespace std;
int main( void )
{
int N;
cin >> N;
int bt = 0, bx = 0, by = 0;
int at, ax, ay;
int t, x, y;
bool can = false;
for( int i = 0; i < N; i++ ) {
cin >> at >> ax >> ay;
t = at - bt;
x = abs( ax - bx );
y = abs( ay - by );
if( t >= x + y && t % 2... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define inf 1000000000000000000
#define bpc(x) __builtin_popcountll(x)
#d... | 0 | 5,587,153 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
if (a > 8 || b > 8)
{
cout << ":(" << endl;
}
else
{
cout << "Yay!" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int arr[n];
for(int i = 0;i< n;i++)
{
cin >> arr[i];
}
int ans = 1000000;
int s_1=0;
int s_2 = 0;
for(int i = 1;i<= n;i++)
{
f... | 0 | 29,371,187 |
#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+... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
using namespace std;
long long MOD = 1000000007;
map<string, int> m={{"Vacant",0}, {"Male",1}, {"Female",-1}};
bool bin_s... | 0 | 61,791,140 |
#include<bits/stdc++.h>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y) make_pair(x,y)
#define vp vector<pair<int,int>>
#define setbits(x) __builtin... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end(), greater<int>());
int slen = s.length();
int tlen = t.length();
int N = min(slen, tlen);
bool enabling = false;
for (int i = 0; i < N; i++) {
if (s.at(i) < t.at(... | 0 | 877,573 |
#include <bits/stdc++.h>
using namespace std;
#define int 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)
#define repm(i,n) for(int i=(i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN... | 0 | 99,179,462 |
#include<bits/stdc++.h>
using namespace std;
#define rush ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define FOR(a,x,n) for(ll a=x;a<n;a++)
#define ROF(a,x,n) for(ll a=x;a>=n;a--)
#define pb push_back
#define lb lower_bound... | #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 | 74,970,640 |
#include<iostream>
using namespace std;
main(){
int i,n;
long long int r;
r=1;
cin>>n;
for(i=1;i<=n;++i){
r=r*i;
}
cout<<r<<endl;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a... | 0 | 46,584,131 |
#include <iostream>
using namespace std;
int main(){
int N,M,P;
while(cin>>N>>M>>P,N||M||P){
int win=0,sum=0;
for(int i=0;i<N;i++){
int num;
cin>>num;
if(i==M-1) win=num;
sum+=num;
}
if(win==0){
cout<<0<<endl;
}else{
cout<<sum*(100-P)/win<<endl;
... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N, M;
cin >> N >> M;
vector<vector<int>> roadTarget(N+1, vector<int>());
for(int i = 0; i < M; i++){
int a, b;
cin >> a >> b;
roadTarget[a].push_back(b);
roadTarget[b].push_back(a);
}
vector<int> a... | 0 | 56,684,858 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char x,y;
cin>>x>>y;
if(x<y) cout<<"<"<<endl;
else if(x==y) cout<<"="<<endl;
else cout<<">"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
struct UnionFind {
int size;
int numComponents;
vector<int> sz;
vector<int> id;
UnionFind(int N) {
size = numComponents = N;
sz = vector<int>(N, 1);
id = vector<int>(N);
for(int i = 0; i < N; i++) {
... | 0 | 63,901,335 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | 0 | 18,259,994 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
vector<string> S(10010);
cin >> N; int ans = 0;
int A = 0, B = 0, BA = 0;
for(int i=0; i<N; i++){
cin >> S[i]; int l = S[i].length();
for(int j=0; j<l-1; j++){
if(S[i][j] == 'A' && S[i][j+1] == 'B') ans++;
}
if(S[i][0] == '... | #include <bits/stdc++.h>
inline int read(){char c = getchar();int x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,... | 0 | 84,622,444 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | #include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#define rep(i,a,b) for(int (i)=(a);i<(b);i++)
#define INF 1000000000
#define MAX_N 150005
using namespace std;
int L[100005];
int main(){
int n,a[100005];
... | 0 | 79,971,509 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <iostream>
using namespace std;
const int G = 1000 + 10;
char a[G][G];
long long dp[G][G];
int main()
{
int h, w;
cin >> h >> w;
for (int i = 0; i < h; i++){
for (int j = 0; j < w; j++){
cin >> a[i][j];
}
}
dp[0][0] = 1;
for (int i = 1; i < w; i++){
if (a[0][i] == '.'){
dp[0][i] = dp[0][i-1];... | 0 | 17,844,881 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, m, t, a[100005];
vector< ll > adj[100005];
#define ari for( int i = 0 ; i < n ; i++ ) cin >> a[i];
#define ginp for( int i = 0 ; i < m ; i++ ){ int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u);}
#define pb push_back
#define s... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
using namespace std;
using ll=long long;
using ld=long double;
#define ssort(n) sort((n).begin(),(n).end())
typedef pair<int,int> P;
int main()
{
int N;
cin >> N;
vector<ll> a(N);
rep(i,N)cin >> a... | 0 | 59,577,405 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
... | #include<bits/stdc++.h>
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define disl... | 0 | 39,460,473 |
#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <bitset>
#include <stack>
#include <deque>
using namespace std;
typedef pair<int, int> pii;
typedef long long LL;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for (int i = 0; i < (n); ++i)
const int INF = 1001001001;
vector<int> to[100005];
void solve(long long N, long long M, std::vector<long long> A, std::vector<long long> B){
rep(i,M){
ll a = A[i]-1;
... | 0 | 96,526,156 |
#include<cstdio>
#include<vector>
std::vector<int>g[100005];
int main(){
int n;
scanf("%d",&n);
int m = 2*n, find = -1;
for(int i = 1; i <= m; i++){
if(m%i==0){
int j = m/i;
if(j==i-1){
find = i;
break;
}
}
}
if(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {
if(a==1 || b==1){
return max(a,b);
}
return a/gcd(a,b)*b;
}
void solve(long long N, long long M, std::vector<long long> a){
ll num = a[0]/... | 0 | 72,080,081 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void solve() {
int n; scanf("%d", &n);
if (n%2) printf("%d", n/2);
else printf("%d", n/... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long ;
int main(){
int n;
cin >> n;
bool ok=false;
vector<ll> a(n);
vector<ll> b(n);
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
ll asum=0,bsum=0;
rep(i,n) asum += a[i];... | 0 | 87,367,244 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
vector<st... | #include<iostream>
using namespace std;
int main()
{
int a[5],temp;
for(int i=0;i<5;i++)
{
cin>>a[i];
}
for(int i =0;i<5;i++)
{
for(int j=0;j<5;j++)
{
if(a[i]>a[j])
{
temp = ... | 0 | 24,816,969 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
string s1,s2,s3;
cin >> s1 >> s2 >> s3;
char c1 = s1[0] - 0x20, c2 = s2[0] - 0x20,c3 = s3[0] - 0x20;
cout << c1 << c2 << c3 << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long ... | 0 | 76,527,506 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
using namespace std;
void func()
{
uint32_t N, maxAi(0), minAi(UINT32_MAX);
cin >> N;
for (size_t i = 0; i < N; ++i)
{
uint32_t Ai;
cin >> Ai;
maxAi = max(Ai, maxAi);
minAi = min(Ai, minAi);
}
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
const ll INF = 1e9;
int main() {
int a,b; cin >> a >> b;
vector<vector<char>> grid1(50,vector<char>(100,'#'));
vector<vector<char>> grid2(50,vector<char>(100,'.'));
int i1 = 1;
in... | 0 | 26,875,368 |
#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long int ll;
ll max(ll a,ll b)
{
return a>b?a:b;
}
int main()
{
ios;
ll a,b,c,d,ed;
cin>>a>>b>>c>>d;
ed=a*c;
ed=max(ed,a*d);
ed=max(ed,b*d);
ed=max(ed,b*c);
cout<<ed<<'\n';
} | #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 | 29,172,693 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
const int INF = 1000000007;
int main(){
int N;
ll K;
cin >> N >> K;
map<int, ll> A;
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
set<int> se;
rep(i, N) se.insert(A[i]);
... | 0 | 53,182,587 |
#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 S [512345];
int main() {
int N;
int left =212345 , right = left +1;
cin >> N;
vector<int> A(N);
rep(i, 0, N){
... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
using namespace std;
const int nmax = 1e9 + 7;
const long long INF = 1e18;
const double PI = 2 * asin(1);
typedef long long ll;
int main(){
int W, H; cin... | 0 | 21,225,368 |
#include<iostream>
using namespace std;
main(){
int x,y,k;
while(1){
cin>>x>>y;
if(x==0 && y==0) break;
if(x>y){
k=x;
x=y;
y=k;
}
cout<<""<<x<<" "<<y<<endl;
}
} | #include<bits/stdc++.h>
#define ll long long int
#define vll vector<pair<ll, ll> >
#define vl vector<ll>
#define vi vector<int>
#define vii vector<pair<int, int> >
const ll mod = 1e9 + 7;
const ll inf = LLONG_MAX;
using namespace std;
ll power_mod(ll x, ll y, ll p)
{
ll ans = 1;
x = x%p;
if(x==0)
return p;
while(y... | 0 | 90,973,044 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODAD... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#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 sz(a) (int)(a).size()... | 0 | 21,342,334 |
#include <stdio.h>
int main(){
int counter = 0;
int val[3] = {0};
scanf("%d %d %d", &val[0], &val[1], &val[2]);
for (int i=val[0]; i<=val[1]; i++){
if ((val[2] % i) == 0){
counter++;
}
}
printf("%d\n", counter);
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[])
{
vector<char> record;
int m, f, r;
while (true)
{
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
break;
if (m == -1 || f == -1)
{
record.push_back(... | 0 | 46,799,469 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int fmt(string s)
{
int ret = 0;
... | #include<cstdio>
#include<cmath>
using namespace std;
int main(){
int N;
scanf("%d", &N);
double dN = N*2;
int m = sqrt(dN);
if(m*(m+1)>>1 != N){
printf("No\n");
return 0;
}
printf("Yes\n%d\n", m+1);
int S[m][m];
for (int i = 0; i < m; ++i) S[i][0] = i + 1;
for (int i = 0; i < m - 1; ++i){
for (int j = ... | 0 | 92,383,267 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 10;
int l[N];
void solve() {
int n, a, b, c; scanf("%d%d%d%d", &n, &a, &b, &c... | #include<bits/stdc++.h>
using namespace std;
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define For(i,n) for(int i=0;i<n;i++)
#define forn(i,n) for(int i=1;i<=n;i++)
#define fors(i,s) for(int i=0;i<s.size();i++)
#define all(v) v.begin(),v.end()
#define gcd(a, b) __gcd(a , b)
#... | 0 | 53,406,568 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
vector<int> a(N, 0);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
int ans = 40000000;
for (int target = -100; target <= 100; ++target) {
int cost = 0;
for (int i = 0; i < N; ++i) {
... | #include <stdio.h>
#define N 101
int main() {
int n,i,k,l,j,u,a[N][N],v[N];
scanf("%d",&n);
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++){
a[i][j] = 0;
}
}
for(i=0;i<n;i++){
scanf("%d",&u);
scanf("%d",&k);
while(k>0){
scanf("%d",&l);
a[u][l] = 1;
k--;
}
}
for(i=1;i<... | 0 | 3,162,353 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,n) for(int i=1;i<=(int)(n);i++)
#define rep3(i,n) for(int i=0;i<=(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
#define ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Arra... | 0 | 92,836,979 |
#include <bits/stdc++.h>
using namespace std;
long long int getMoves(long long int b,long long int a){
return b-a;
}
int main() {
string a;
cin >> a;
long long int k = 0;
long long int st = 0;
long long int ans = 0;
for(long long int i=0;i<a.size();i+=1){
if(a[i]=='W' && k==1 ){
ans+... | #include <cstdio>
int main()
{
int a,b;
scanf("%d %d", &a, &b);
if (a == 1)
{
a = 14;
}
if (b == 1)
{
b = 14;
}
if (a > b)
{
printf("Alice");
}
else if (b > a)
{
printf("Bob");
}
else if (a == b)
{
printf("Draw");
... | 0 | 15,050,217 |
#include <bits/stdc++.h>
using namespace std;
#define dhoom ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
const ll inf = 1e18;
const int nax = 2e6 + 7;
const ll mod = 1e9 + 7;
int count(ll x){
int cnt = 0;
while(x != 0){
cnt++;
x /= 10;
}
return c... | #include <bits/stdc++.h>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define ALL(i) (i).begin(), (i).end()
#define FOR(i, a, n) for(int i=(a);i<(n);++i)
#define RFOR(i, a, n) ... | 0 | 56,093,918 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k; cin>>a>>b>>k;
for(int i=1; i<=k; i++){
if(i%2==1){
if(a%2==0){
a=a/2;
b+=a;
}
else{
a=a-1; a=a/2;
b+=a;
}
}
... | 0 | 57,972,055 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define int lli
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<lli> vli;
typedef vector<pii> vii;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int xd[4] = {1, 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cerr<<#var<<"="<<var<<endl;
#define dup(x,y) (((x)+(y)-1)/(y))
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int... | 0 | 64,372,792 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=1e5+5,p=1e9+7;
typedef long long ll;
int n,C[2][maxn],a,b,inv[maxn];
int Appear[maxn];
void Copy(int x[],int y[],int k){
for(int i=0;i<k;i++)
x[i]=y[i];
}
void gcd(ll a,ll b,ll &d,ll &x,ll &y){
if(!b){
d=a;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return v... | 0 | 25,169,118 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(){
int s;
cin >> s;
map<int, int> memo;
int cur = s;
do{
if(memo.count(cur)) break;
memo[cur] = 1;
if(cur % 2 == 0) cur /= 2;
else cur = cur*3+1;
}while(1);
cout << memo.size()+... | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,k;
cin>>n>>k;
vector<int>a(n);
rep(i,n)cin>>a[i];
int cnt=0;
int ans=0;
vector<int>counter(n,0);
rep(i,n){
counter[a[i]-1]+=1;
}
int c=0;
rep... | 0 | 90,229,271 |
#include <bits/stdc++.h>
using namespace std;
long long RepeatSquaring(long long N, long long P){
if (P == 0) return 1;
if (P % 2 == 0) {
long long t = RepeatSquaring(N, P / 2);
return t * t;
}
return N * RepeatSquaring(N, P - 1);
}
int main(){
int N,P;cin>>N>>P;
for(int i=0;i<N;i++)... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 0 | 67,634,493 |
#include <iostream>
using namespace std;
int main(void){
int a, b, c, d;
cin>>a>>b>>c>>d;
int ans = min(a, b)+min(c,d);
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;... | 0 | 38,391,848 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> dp(n + 1, -1);
queue<int> q;
dp[0] = 0;
q.push(0);
while(!q.empty()) {
int temp = q.front();
q.pop();
if (temp + 1 <= n && dp[temp + 1] < 0) {
dp... | #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 MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP m... | 0 | 41,866,448 |
#include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <sstream>
type... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 56,440,424 |
#include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) vector <int> a(n); rr(i, n) cin >> a[i]
#define pvec(a) rr(i, a.size()) cout << a[i] << " "; cout << endl
#define bug(x) cout << #x << " " << x << endl
#define ll long long
#define vii vector <int>
using namespace std;
void s... | #include <iostream>
#include <stdio.h>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int maxn=1e5+111;
int main(){
int n,m;
scanf("%d%d",&n,&m);
int... | 0 | 26,807,767 |
#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(){
ll N; cin >> N;
ll p = 5;
if (N%2==0){... | #include<iostream>
#include<vector>
using namespace std;
#define FOR(i,a) for(int i=0;i<(int)(a);i++)
#define pb push_back
#define clr clear()
#define sz size()
typedef unsigned int ui;
class node{
public:
int num;
void set(int n){num = n;}
bool equal(int a){
return num == a;
}
};
class edge{
public:
node... | 0 | 35,991,113 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
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 prt(v) cout<<(v)<<"\n";
#define fi(v) get<0>(v)
#define se... | #include <bits/stdc++.h>
using namespace std;
#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(n) begin(n),end(n)
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww{cww(){ios::sync_with_stdio(fa... | 0 | 64,893,593 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> r1(N);
rep(i, 0, N) cin >> r1[i];
vector<int> r2(N);
... | #include <bits/stdc++.h>
using namespace std;
const int N = int(1e6) + 5;
int _size[N], root[N];
int n;
void Init() {
for (int i=1; i<=n; i++) {
_size[i] = 1;
root[i] = i;
}
}
int GetRoot(int x) {
while (root[x] != x) {
root[x] = root[root[x]];
x = root[x];
}
return x... | 0 | 97,978,916 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(),... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | 0 | 12,703,389 |
#include<iostream>
using namespace std;
int main(){
int m, f, r, hasi;
char seiseki[100];
for (int i = 0; i < 100; i++){
cin >> m;
cin >> f;
cin >> r;
if (m == -1 && f == -1 && r == -1){
break;
}
if (m == -1 || f == -1){
seiseki[i] = 'F';
}
else if (m + f >= 80){
seiseki[i] = 'A';
}
else... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.e... | 0 | 26,621,098 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
us... | 0 | 20,819,312 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int n = s.size();
vector<vector<ll>> dp(n, ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n,d,x;
int sum = 0;
int coe=0;
... | 0 | 52,741,206 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string S, T;
cin >> S >> T;
string S2 = S + S;
long long int p = S2.find(T);
if(p == S2.npos)
{
cout << "No" << endl;
}
else
{
cout << "Yes" << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(void){
int info;
cin >> info;
int b = 0,f = 0,r = 0,v = 0;
int room[4][3][10]={{{}}};
for (int i = 1; i <= info; i++){
cin >> b >> f >> r >> v;
room[b-1][f-1][r-1] += v;
}
for (int x = 0; x <= 3; x++){
for (int y = 0; y... | 0 | 47,645,838 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long a, long long b){
if(a+b == 15) cout << '+' << endl;
else if(a*b == 15) cout << '*' << endl;
else cout << 'x' << endl;
}
int main(){
long long a;
scanf("%lld",&a);
long long b;
scanf("%lld",&b);
solve... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<vector<int>> A(3,vector<int>(3));
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin >> A.at(i).at(j);
}
}
vector<vector<bool>> bingo(3,vector<bool>(3,false));
int N;
cin >> N;
for(int i=0;i<N;i++){
int B;
cin >> B;
fo... | 0 | 65,523,141 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
using vvi=vector<vi>;
using vs=vector<string>;
int main() {
ll L,R; cin >>L >>R;
ll ans=pow(10,9);
for... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
int main() {
int n, m, a, b;
cin >> n >> m;
vector<vector<int>> g(n);
rep(i, 0, m) {
cin >> a >> b;
--a, --b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> ... | 0 | 92,843,650 |
#include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int n, ans = 0;
cin >> n;
int l, r;
for(int i = 0; i < n; i++)
{
cin >> l >> r;
ans += r - l + 1;
}
cout << ans;
} | #include<iostream>
#include<stdio.h>
#include<cctype>
using namespace std;
int main(){
char c;
while(1){
scanf("%c",&c);
if(isupper(c)){
c=tolower(c);
}else{
c=toupper(c);
}
cout<<c;
if(c=='\n'){break;}
}
return 0;
} | 0 | 3,132,904 |
#include<iostream>
using namespace std;
int main()
{
int n,x,y,tot=0;cin>>n>>x>>y;
while(1)
{
if(x+1==y)
{
if(tot%2)cout<<"Alice";
else cout<<"Borys";
return 0;
}
if(!tot%2)x++;
else y--;
tot++;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.begin(); i != vec.end(); ++i)
const int mod = 10... | 0 | 31,275,959 |
#include <bits/stdc++.h>
using namespace std;
bool Check(int num){
string s = to_string(num);
int len = s.size();
for(int i=0;i<(len/2);i++){
if(s[i] != s[len-i-1]) return false;
}
return true;
}
int main(void){
int A,B,ans=0;
cin >> A >> B;
for(int i=A;i<=B;i++) if(Check(i)) ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n,c,k;
cin>>n>>c>>k;
vector<long long> t(n);
for(long long &x: t) cin>>x;
sort(t.begin(),t.end());
long long count=0,memo=0;
bool flag=false;
for(long long i=0;i<n;){
if(flag==false){
if(i==n-1) {count++; break;}
}
long... | 0 | 100,219,162 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,r) for(int i = 0; i < (r); i++)
#define pb push_back
#define ALL(a) a.begin(), a.end()
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define uint unsigned long long
#define endl '\n'
template<typename T> ostream &operato... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin>>n,n){
int num[1001]={};
for(int i=0;i<n;i++){
cin>>num[i];
num[1000]+=num[i];
}
sort(num,num+n);
cout<<(num[1000]-num[0]-num[n-1])/(n-2)<<endl;
}
} | 0 | 56,271,225 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int N, K; cin >> N >> K;
vector<pair<int, int>> xy(N);
for (int i = 0; i < N; i++) cin >> xy[i].first >> xy[i].second;
sort(xy.begin(), xy.end());
ll ans = LLONG_MAX;
for (int i = 0; i < N-1; i++) {
for (int... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) ... | 0 | 52,378,166 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll=long long;
int main(void){
int N,M;
cin >>N>>M;
bool AC[N];
int WA[N];
int WAsum=0;
int ACsum=0;
rep(i,N){
WA[i]=0;
AC[i]=false;
}
while(M>0){
int p;
string s;
ci... | #include <bits/stdc++.h>
#include <algorithm>
#include <atcoder/all>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = ... | 0 | 47,534,477 |
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
ll N, C, K;
cin >> N >> C >> K;
vector<ll> T(N);
rep(i, N) cin >> T[i];
sor... | 0 | 67,869,289 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n;
cin>>n;
vector<ll> a(n);
rep(i,n) cin>>a[i];
ll ans=1000;
rep(i,n-1){
if(... | #include <bits/stdc++.h>
using namespace ::std;
template<typename T> T nxt() {T res; cin >> res; return res;}
#define tests() for (int _ = nxt<int>(); _ >= 0; _--)
#define nxt1(t,n) t (n); cin >> n
#define nxt2(t,n,m) t (n),(m); cin >> n >> m
#define nxt3(t,n,m,k) t (n),(m),(k); cin >> n >> m >> k
#define rep(i, A) for... | 0 | 6,315,829 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
using namespace std;
int main(){
ll n,t;
cin>>n>>t;
vector<ll> a(n,0);
rep(i,n){
... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define bil (... | 0 | 28,253,557 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if ( s[0] + s[1] + s[2] == 294 ){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
string t="zyxwvutsrqponmlkjihgfedcba";
if(s==t){
cout<<-1<<endl;
return 0;
}
vector<bool> siyou(26,0);
int n=s.size();
for(int i=0;i<n;i++){
int x=s[i]-'a';
siyou[x]=1;
}
if(s.size()==26){
string u;
... | 0 | 73,983,070 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n,k;cin>>n>>k;
if(n%k == 0)cout<<"0";
else cout<<"1";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
ll ans = 0;
for (ll i = n - 1; i >= 0; i--) {
if ((a[i] + ans) % b[i] == 0) continue;
... | 0 | 58,395,405 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int H,W,A,B;
cin>>H>>W>>A>>B;
for(int i=0;i<B;i++){
for(int j=0;j<A;j++)cout<<0;
for(int j=A;j<W;j++)cout<<1;
cout<<endl;
}
for(int i=B;i<H;i++){
for(int j=0;j<A;j++)cout<<1;
for(int j=A;j<W;j++)cout<<0;
... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); i++)
#define REP(i,n) for (int i=0; i<(n); i++)
#define RREP(i,n) for (int i=(n-1); i>=0; i--)
#defin... | 0 | 60,207,106 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
int main(){
int n; cin >> n;
vector<string> field(n);
for(auto& v:field){
cin >> v;
}
int ans = 0;
for(int k=0; k<n; k++){
bool ok = true;
for(int i... | #include<iostream>
#include<string>
#include<cstdio>
#include <cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#i... | 0 | 28,697,848 |
#include <iostream>
#include <sstream>
#include <algorithm>
int main(int argc, char const *argv[]) {
std::string Source;
std::string Param;
unsigned short q = 0;
std::istringstream iss;
getline(std::cin, Source);
getline(std::cin, Param);
iss.str(Param);
iss >> q;
iss.clear();
for (size_t i = 0; i <... | #include <stdio.h>
int main() {
double x1, y1, x2, y2, x3, y3, xp, yp;
double s, t;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf", &x1, &y1, &x2, &y2, &x3, &y3, &xp, &yp) != EOF) {
s = ((xp - x1) * (y3 - y1) - (yp - y1) * (x3 - x1)) /
((x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1));
t = ((xp - x1) * (y2 - y1... | 0 | 25,688,615 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
vector<int> H(N);
rep(i,N) cin >> H[i];
in... | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
... | 0 | 55,812,284 |
#include <algorithm>
#include <iostream>
#include <string>
#include <stack>
#include <utility>
#include <vector>
#include <math.h>
#define rep(i, n) for (auto i = 0; i < (n); i++)
#define MOD 1e9 + 7
typedef long long ll;
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
char c[h][w];
rep(i, h)... | #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 h,w;cin>>h>>w;
vector<vector<char>> a(h,vector<char>(w));
rep(i,h)rep(j,w)cin>>a[i][j];
vector<bool> b(h),c(w);
rep(i,h)rep(j,w){
if(a[i][j]==... | 0 | 83,524,405 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int x, n;
cin >> x >> n;
if (n == 0) {
cout << x << endl;
}
else {
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
sort(p.begin(), p.end());
int a;
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pai... | 0 | 100,126,603 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
using P =pair<int,int>;
int main(){
int A,B,C;
cin>>A>>B>>C;
if(A==B&&B==C){
cout<<"Yes";
}else{
cout<<"No";
}
return 0;} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline voi... | 0 | 9,684,701 |
#include <iostream>
#include <utility>
#include <cstdio>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
int count = 0;
for (int i = a; i <= b; ++i) {
if (c % i == 0) { ++count; }
}
printf("%d\n", count);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
for(int bit=0; bit<(1<<3); ++bit){
int sum = s[0]-'0';
for(int i=1; i<=3; ++i){
if(bit & (1<<(i-1))) sum += s[i]-'0';
else sum -= s[i]-'0';
}
if(sum == 7){
cout << s[0];
for(int i=1; i<=3; ++i){
... | 0 | 41,622,000 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,P> pip;
typedef long long ll;
const int inf=(1<<31)-1;
c... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<string> w(n);
set<string> chk;
for(int i = 0; i < n; i++) {
cin >> w[i];
int chk_size0 = chk.size();
chk.insert(w[i]);
int chk_size1 = chk.size();
if(chk_size0==chk_size1) {
... | 0 | 58,362,044 |
#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 ll long long
#define ld long double
#define forn(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend();
#define isS... | 0 | 8,765,418 |
#include <iostream>
#include <vector>
using namespace std;
const int nmax=100005;
vector<int> v[nmax];
int viz[nmax],sg[nmax];
int n,i,a,b;
void dfs(int x)
{
viz[x]=1;
for(int i=0;i<v[x].size();i++)
if(!viz[v[x][i]])
{
dfs(v[x][i]);
sg[x]^=(sg[v[x][i]]+1);
}
}
int main()
{
io... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 0 | 49,122,419 |
#include <bits/stdc++.h>
#define rep(i, a) for (ll i = 0; i < (a); ++i)
#define pb push_back
#define all(v) v.begin(),v.end()
#define sort_1(v) sort(v.begin(),v.end())
#define sort_2(v) sort(v.begin(),v.end(),greater<ll>())
#define reverse(v) reverse(v.begin(),v.end())
typedef long long ll;
typedef long double la;
usin... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N, answer = 1;
string S;
cin >> N >> S;
unordered_map<char,long long> mp;
for (int i = 0; i < N; i++) {
mp[S.at(i)]++;
}
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
answer *= itr->second + 1;
... | 0 | 53,119,673 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
cout << (s.find("YAKI")==0 ? "Yes": "No");
} | #include <iostream>
using namespace std;
int main() {
string str;
getline(cin, str);
for (string::iterator it = str.begin(); it != str.end(); ++it) {
if (0x41 <= *it && *it <= 0x5a) {
cout << char(*it + 0x20);
continue;
}
if (0x61 <= *it && *it <= 0x7a) {
... | 0 | 88,770,173 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
int n;
ll res[N];
vector<pair<int, int>> V;
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1, a; i <= n; ++i) {
cin >> a;
V.emplace_back(a, i);
}
V.emplace_back(0, n + ... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#de... | 0 | 25,574,463 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t, k; cin >> t >> k;
int sum = 0;
for (int i = 0; i < t; ++i)
{
... | #include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | 0 | 39,866,575 |
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int cnt[26];
signed main(){
ios_base::... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 86,267,812 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | #include<cstdio>
#include<algorithm>
using namespace std;
struct Card{
char suit;
int value;
};
Card Input, B[36], S[36];
int N;
void BubbleSort(Card C[]){
for(int i = 0; i < N; i++){
for(int j = N - 1; j > i; j--){
if(C[j].value < C[j-1].value){
swap(C[j], C[j-1]);
}
}
}
}
void SelectionSort(Card C[]... | 0 | 37,098,593 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <tuple>
#include <map>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <limits>
#include <unordered_map>
#include <map>
#include <cmath>
using namespace std;
typedef long long ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define endl '\n'
#define x first
#define y second
#define int long long
#define all(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cout << #x << " = " << x << endl;
#else
#define dbg(x)
#endif
using namespace std;
void solve(... | 0 | 60,651,336 |
#include<bits/stdc++.h>
using namespace std;
int n,ans,a[100010];
int main()
{
cin>>n;
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(int i=2;i<=n;i++) ans+=(a[i]==a[i-1]);
if(ans%2==1) ans++;
cout<<n-ans<<"\n";
return 0;
} | #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... | 0 | 87,608,986 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000... | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<cmath>
#define REP(i,n) for (int i = 0; (i) < (n); ++ (i))
#define FOR(i,n) for (int i = 1; (i) <= (n); ++ (i))
#define dump(x) cout << #x << " = " << (x) ... | 0 | 91,192,327 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
const ll INF = 10e9;
const ll mod = 10e9+7;
int main(){
int n,m; cin>>n>>m;
vector<ll> dp(n+1, -1);
dp[0]=1;
dp[1]=1;
rep(i,m){
int a; cin>>a;
dp[a]=0;
}
for (int i=2; i<=n; i++){
if(dp[i... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typ... | 0 | 60,861,390 |
#include <iostream>
using namespace std;
int main() {
int cnt = 0, res = 0;
for (int i = 0; i < 3; ++i) {
char c;
cin >> c;
if (c == 'R') cnt++;
else cnt = 0;
res = max(cnt, res);
}
cout << res << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define maxn 100005
#define F first
#define S second
#define fi(i,a,b) for(int i=a; i<=b; i++)
#define fid(i,a,b) for(int i=a; i>=b; i--)
#define VanLoi "a"
#define gb(i, j) ((i >> j) & 1)
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#de... | 0 | 88,373,186 |
#include <iostream>
#include <vector>
#include <algorithm>
bool isPrime(int num){
if(num<2){
return false;
}
for(int i{2};i*i<=num;++i){
if(num%i==0){
return false;
}
}
return true;
}
int main(){
const int MAX_NUM{1000000};
int NUM{0};
std::vector<bool> vPrime(MAX_NUM,false);
for(int i{0};i<MAX_NUM;++... | #include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.141592653... | 0 | 82,229,929 |
#include<iostream>
#include<algorithm>
using namespace std;
const int sz=5e3+10;
int n,k;
int len,a[sz];
main()
{
cin.tie(0);
ios::sync_with_stdio(0);
cin>>n>>k;
len=0;
int ans=n;
for(int i=1;i<=n;i++)
{
int x;
cin>>x;
if(x>=k)ans--;
else a[len++]=x;
}
... | #include <iostream>
#include <algorithm>
#include <queue>
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::priority_queue<int> pq;
for(int i=0; i<10; ++i){
int input;
std::cin >> input;
pq.push(input);
}
for(int i=0; i<3; ++i){
std::cout << pq.t... | 0 | 93,046,985 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.