code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main() {
int W,H,N,x,y,a; cin>>W>>H>>N;
int ans[W][H]={0};
for(int i=0; i<N; i++){
cin>>x>>y>>a;
if(a==1){
for(int j=0; j<x; j++){
for(int k=0; k<H; k++) ans[j][k]=1;
}
}
else if... | 0 | 12,116,866 |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 2e5 + 1;
int n;
vector<int> g[sz];
ll ans = 0;
void dfs(int v, int pred) {
for (int to : g[v]) {
if (to ^ pred) {
ll l = min(v, to) + 1;
ll r = max(v, to) + 1;
ans -= l * (n - r + 1);
dfs(to... | #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<cstdio>
#include<cstring>
#include<sstream>
#define X fi... | 0 | 21,133,591 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B; cin >> A >> B;
vector<char> S(A + B + 1);
for (int i = 0; i < A + B + 1; i++) {
cin >> S.at(i);
}
string ans = "Yes";
if (S.at(A) != '-') ans = "No";
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == '-' &... | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
using namespace std;
int modpow(int x, int y, int m = mod) {
int res = 1;
while (y) {
if (y % 2) {
res *= x;
res %= m;... | 0 | 58,232,625 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >>a>>b;
b.pop_back();
if(a==b){
cout <<"Yes"<<endl;
}
else
cout <<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
... | 0 | 89,213,681 |
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
int main() {
ll n, k; cin >> n >> k;
ll mini, maxi, res;
mini = maxi = res = 0;
REP(i, k - 1) {
mini += i;
maxi += n - i;
}
for (ll i = k - 1; i < n + 1; i++) {
m... | #include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <cstring>
using namespace std;
#define X first
#define Y second
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define de(x,y) cout<<#x<<" :"<<x<<... | 0 | 76,538,026 |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i... | #include <iostream>
#include <string>
using namespace std;
void solve(){
int n, m; cin >> n >> m;
string sn[n], sm[m];
for(int i = 0; i < n; ++i) cin >> sn[i];
for(int i = 0; i < m; ++i) cin >> sm[i];
for(int i = 0; i < n-m+1; i++){
for(int j = 0; j < n-m+1; j++){
int flag = 1;
int cnt = 0;
... | 0 | 25,807,974 |
#include <cstdio>
#include <cmath>
double theta = M_PI/3.0;
void koch(double *left, double *right, int m){
if (m==0){
std::printf("%f %f\n", left[0], left[1]);
}
else{
double s[2], u[2], t[2];
s[0] = (2*left[0] + right[0])/3.0;
s[1] = (2*left[1] + right[1])/3.0;
t[0] = (left[0] + 2*right[0])/3.0;
t[1] = ... | #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>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int n;
map<ll, ll> mp;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
vector<... | 0 | 69,349,285 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x);1
#define fs first
#define sc second
#define pb push_b... | #include <iostream>
#include <stdio.h>
#include <math.h>
#include <string>
using namespace std;
int main() {
char s;
int a[26] = {};
while (cin >> s) {
if (islower(s)) a[s - 'a']++;
if (isupper(s)) a[s - 'A']++;
}
for (int i = 0; i < 26; i++) {
char ch = i + 'a';
cout << ch << " : " << a[i] << endl;
}
re... | 0 | 17,073,662 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
string n;
int main(){
cin >> n;
rep(i, n.size()){
if (n[i]=='1') n[i]='9';
else n[i]='1';
}
cout... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,c,k;
cin >> n >> c >> k;
vector<int> t(n);
... | 0 | 54,302,685 |
#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;
#ifndef bhartiya
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#define int long long
typedef long long ll;
typedef long double ld;
typedef pa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
#define all(x) (x).begin(),(x).end()
int main(){
int n,m; cin>>n>>m;
vector<pair<ll,ll>> vp(n);
rep(i,n){
int a,b; cin>>a>>b;
vp[i]=make_pair(a,b);
}
sort(all(vp));
int i=0;
ll ans=0;
while(m>0){
... | 0 | 3,902,449 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
ll sum(ll n) {
if(n==0) {
return 0;
}
ll s=n+sum(n-1);
return s;
}
int main() {
ll N;
cin>>N;
cout<<sum(N)<<endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
int n, m, a1=0, a2=0;
cin >> n >> m;
vector<bool>ac(n);
vector<int>wa(n);
for(int i=0; i<n; i++){
wa[i]=0;
ac[i]=0;
}
int c;
string s;
for(int i=0; i<m; i++){
cin >> c >> s;
if(s[... | 0 | 95,085,877 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
typedef long long ll;
const ll INF = 1LL << 35;
int main(){
ll N,K;
cin >> N >> K;
vector<vector<ll> > sushi(N);
rep(i,N){
int t,d;cin >> t >> d;
t--;
sushi[t].push_back(d);
}
for(... | 0 | 98,156,520 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int l=s.length();
vector<int>res;
for(int i=0; i<l; i++)
{
if(s[i]=='0')
{
res.push_back(0);
}
else{
if(s[i]=='1')
res.push_back(1);
els... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
#define ll long long
#define MAX 100100
inline int read()
{
int x=0;bool t=false;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')t=true,ch=getchar();
while(ch<='9'&&ch>='0')x=x*10+ch... | 0 | 35,972,106 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,t;
cin>>n>>x>>t;
for(int i=1;i>0;i++)
{
if(i*x>=n)
{
cout<<i*t;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MOD;
a=a*a%... | 0 | 35,121,750 |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | 0 | 43,429,853 |
#include<iostream>
#include<vector>
#include <algorithm>
#define ll long long
using namespace std;
int main(){
ll h, w,_s, s, l1;
vector<int> ans;
cin >> h >> w;
if(h % 3 == 0 || w % 3 == 0){
cout << 0 << endl;
}else{
_s = h * w;
s = _s / 3;
l1 = s / w;
vector... | #include<bits/stdc++.h>
#include<cstring>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define ps(x,y) fixed<<setprecision(y)<<x
#define arr(a,n) int n... | 0 | 57,597,565 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<in... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 85,528,082 |
#include<bits/stdc++.h>
using namespace std;
int dist(int a, int b, int c, int d) {
return abs(a-c)+abs(b-d);
}
int main () {
long long n;
cin >> n;
int t[100000];
int x[100000];
int y[100000];
t[0] = 0;
x[0] = 0;
y[0] = 0;
for (int i=1; i<=n; i++) {
cin >> t[i] >> x[i] >> y[i];
int a, b, c;
a = t[i] - ... | #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 fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | 0 | 46,210,294 |
#include <cstddef>
#include <vector>
template <class S>
void subset_zeta_transform(std::vector<typename S::value_type> &a) {
using size_t = std::size_t;
const size_t n = a.size();
for (size_t i = 1; i < n; i *= 2) {
for (size_t j = 0; j != n; j += 1) {
if ((j & i) != 0)
a[j] = S::operation(a[j &... | #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 | 60,516,714 |
#include <iostream>
using namespace std;
int main(){
int X,A,B;
cin >> X >> A >> B;
if(A >= B){
cout << "delicious";
}
else if(A+X >= B){
cout << "safe";
}else{
cout << "dangerous";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge {int to, cost; };
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
ll GCD(ll a, ll b){
if(b==0) return a;
else return GCD(b, a%b);
}
ll LCM(ll a, ll b){
if(a<b) swap(a,b);
return a/GCD(a,b)*b;
}
int main... | 0 | 59,905,431 |
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <limits>
using ll = long long;
using ld = long double;
ll MOD = 1e9 + 7;
using namespace std;
... | #include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
ll gcd(ll a, ll b)
{
if (a < b)
{
return gcd(b, a);
}
while (b != 0)
{
ll tmp = b;
b = a % b;
a = tmp;
}
return a;
}
void apply(vector<v... | 0 | 98,330,444 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
ll ans = 0;
int tmp;
int n, m;
cin >> n >> m;
vector<string> a(n), b(m);
REP(i, n) cin >> a[i];
REP(i, ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
int main(){
int n,d,a;
cin>>n>>d>>a;
vector<pair<int,int>> p(n);
for(auto& e:p)cin>>e.first>>e.second;
sort(p.begin(),p.end());
vector<int> s(n+1);
int r=0;
long long ans=0;
rep(i,n){
p[i].second-... | 0 | 20,222,244 |
#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
void dfs(ve<ve<int>> &G, ve<int> &ans,int i, int j,int a){
ans[i] += a;
for(int x:G[i]){
if(x==j) continue;
dfs(G,ans,x,i,ans[i]);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
map<string, int> ma;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (ma.count(s)) {
... | 0 | 29,766,597 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, ss, ee) for (int i = (ss); i <= (ee); ++i)
void solve() {
int N;
cin >> N;
rep(a, 0, 25) {
rep(b, 0, 14) {
if (a * 4 + b * 7 == N) {
cout << "Yes" << endl;
return;
};
}
}
cout << "No" << endl;
}
int main() {
ios... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int gcd(int a, int b) {
if (a > b) {
ll tmp = b;
b = a;
a = tmp;
}
int r = b % a;
while (r != 0) {
b... | 0 | 90,868,581 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0; i<n; i++)
#define print(n) cout<<n<<endl;
int a=0,b=0,c=0;
signed main(){
vector<vector<int>... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
const int N = 1000005;
#define ld long double
#define PI 3.14159265358979323846
const int INF = 1e9+7;
void flash()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.setf(i... | 0 | 68,371,856 |
#include <iostream>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n, l;
vector<string> S;
cin >> n >> l ;
for( int i = 0 ; i < n ; i++){
string str;
cin >> str;
S.push_back(str);
}
sort(S.begin(), S.end()... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <math.h>
#include <string>
#include <sstream>
#include <stack>
#include <deque>
#define pb push_back
#define make ... | 0 | 28,000,306 |
#include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector< pair<int, int> > vii;
typedef vector< ... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
vector<int> x = {1,-1,0,0};
vector<int> y = {0,0,-1,1};
int main(){
map<ll,ll> data;
ll n;
c... | 0 | 33,919,087 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
int H, W;
cin >> H >> W;
vector<vector<int> > A(H, vector<int>(W, 0));
int nbBlack = 0;
queue<pair<int, int> > nextQue;
for (int i = 0; i < H; ++i) {
string s;
cin >> s;
for (int j = 0; j < W; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b)... | 0 | 93,014,201 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vv vector<ll>
#define MAX 105000
#define fr(i,x) for(int i=0;i<x;i++)
int dx[4] = {-1,0,0,1};
int dy[4] = {0,-1,1,0};
bool sortbysec(const pair<int,int> &a,
const pair<int,int> &b)
{
if(a.first ==... | #include<iostream>
using namespace std;
int Selection_sort(int dat[],int size){
int min,count=0;
for(int i=0;i<size;++i){
min=i;
for(int j=i;j<size;++j){
if(dat[j]<dat[min]) min=j;
}
if(min!=i) ++count;
swap(dat[i],dat[min]);
}
return count;
}
int main(... | 0 | 91,161,387 |
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int N;
scanf("%d",&N);
if(N==0)break;
int a[1145];
rep(i,N){
scanf("%d",&a[i]);
}
sort(a,a+N)... | #include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | 0 | 100,538,276 |
#include <bits/stdc++.h>
using namespace std;
struct P
{
int x,y;
bool operator<(const P &a)const{
return x>a.x;
}
};
vector<P> v[101103];
int a,c,i,b,k,n,d,m;
int o[100130];
int l[101103];
double j[1030];
int e[110];
int dx[10]={1,0,-1,0,1,1,-1,-1},dy[10]={0,1,0,-1,1,-1,1,-1},dz[10]={0,0,0,0,... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 71,051,201 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
int main() {
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a), q(b), r(c);
rep(i,a) cin >> p[i];
rep(i,b) cin >> q[i];
rep(i,c) cin >> r[i];
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if ... | 0 | 66,213,710 |
#include <iostream>
using namespace std;
#define rep(i,a,b) for(int i=(int)a,i<(int)b;++i)
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
string s;
int ans=0;
int l=0,r=0,pre=0;
for(int i = 0; i<n;i++){
cin >> s;
if(s[0] == 'l'){
l+=1;
l%=2;
}
if(s[0] == '... | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
usin... | 0 | 7,653,559 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DEBUG 1
#if DEBUG
#define _GLIBCXX_DEBUG
#define DUMP(a) REP(_i, a.size()) cout << a[_i] << (_i + 1 == a.size() ? "\n" : " ")
#define DUMP2... | #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 make_pair
#... | 0 | 1,175,573 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <math.h>
using namespace std;
int list[1000000]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73,
79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163,
167, 173, 179, 181, 191, 193, 197, 199, 21... | #include <iostream>
using namespace std;
int main()
{
int rating, kyu;
cin >> rating;
if(rating >= 400 && rating <= 599)
{
kyu = 8;
}
if(rating >= 600 && rating <= 799)
{
kyu = 7;
}
if(rating >= 800 && rating <= 999)
{
kyu = 6;
}
if(rating >= 1000 && rating <= 1199)
{
kyu = 5;
... | 0 | 61,629,244 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | #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 = 998244353;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace st... | 0 | 65,146,568 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef vector<int> vec;
int main(){
long a,b,c,d; cin>>a>>b>>c>>d;
if(b>0&&d>0)cout<<max(a*c,b*d);
else if(a<0&&c<0)cout<<a*c;
else cout<<max(a*d,b*c);
} | #include <iostream>
constexpr long long MOD = 1'000'000'007;
long long comb(long long n, long long r) {
if (n <= 0 || r < 0) return 0LL;
if (n < r) return 0LL;
r = std::min(r, n - r);
if (r == 0LL) return 1LL;
if (r == 1LL) return n;
int inverse[r + 1];
for (long long i = 1LL; i <= r; ++i) {... | 0 | 51,608,789 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<map>
#include<math.h>
#include<string>
#include <cctype>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1ll<<60;
usin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(ll i=a;i<=b;i++)
#define fi(i,a,b) for(ll i=a-1;i>=b;i--)
#define endl '\n'
#define spc " "
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.14159265358979323
#define sz(a) (int)((a).size())
#define len(... | 0 | 31,581,919 |
#include <bits/stdc++.h>
using namespace std;
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr << #v << "="; for (auto _x : v) c... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 51,035,716 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n, k, ans = 0;
cin >> n >> k;
while (n--)
{
int a;
cin >> a;
ans += a >= k;
}
cout << ans << "\n";
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | 0 | 66,198,311 |
#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>;
const int MOD = 1000000007;
int main() {
string S;
cin >> S;
int ans = 2;
while (S.size() > 2) {
S = S.substr(0, S.size() - 1);
if (S.size() % 2 =... | #include <iostream>
using namespace std;
int main() {
int N;
int t[110000], x[110000], y[110000];
cin >> N;
t[0] = x[0] = y[0] = 0;
for (int i = 0; i < N; ++i) cin >> t[i+1] >> x[i+1] >> y[i+1];
bool can = true;
for (int i = 0; i < N; ++i) {
int dt = t[i+1] - t[i];
int di... | 0 | 44,652,428 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a) for(int i=0; i<a;i++)
#define loop2(i,a,b) for(int i=(a... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
#define int long long
signed main() {
while (true) {
int m, n1, n2;
cin >> m >> n1 >> n2;
if (!m && !n1 && !n2) return 0;
int p[m];
for (int i = 0; i < m; i++) {
cin >> p[i];
}
int diff ... | 0 | 8,999,215 |
#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define all(a) a.begin(), a.end()
#define sz(a) a.size()
#define pb push_back
using namespace std;
const ll mod = 1e9+7;
ll n, d[10000001], ans=0;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("A.txt", "r",... | #include<stdio.h>
#include<string.h>
int main()
{
char s[12];
scanf("%s",s);
int mark=0;
int len=strlen(s);
char c[12]={'\0'};
int d = 0;
for(int i = 0; i < len; i++){
if(s[i]=='0'){
c[d]='0';
d++;
}
else if(s[i]=='1'){
c[d]='1';
d++;
}
else if(s[i]=='B'){
if(d != 0){
d--;
c[d]='... | 0 | 7,899,681 |
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
using namespace std;
int main() {
double a, b, C;
cin >> a; cin >> b; cin >> C;
double S, L, h;
S = a * b * sin(C * M_PI / 180.0) / 2.0;
L = a + b + sqrt(a * a + b * b - 2 * a * b * cos(C * M_PI / 180.0));
h = 2.0 * S / a;
cout << ... | #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;
using namespace std;
int main()
{
FAST
ll n;
cin>>n;
ll arr[n];
for(ll i=0;i<n;i++)
cin>>arr[i];
ll sum = 0;
for(ll i=0;i<64;i++)
{
ll... | 0 | 3,671,243 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
char last = '-', current;
int n, sum = 0;
cin >> n;
cin.get();
for (int i = 0; i < n; i++) {
cin.get(current);
if (current != last) {
last = c... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int n, d, x;
cin >> n ;
cin >> d >> x;
int a[n];
rep(i, n) cin >> a[i];
int res = 0, date = 1;
for(int i=0; i<n; i++){
res++;
date = 1;
while(true){
date +... | 0 | 53,463,736 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(void){
int n, a, b;
cin >> n >> a >> b;
if((b - a) % 2){
cout << "Borys" << "\n"... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | 0 | 26,940,153 |
#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>
using namespace std;
#define rep(i, n) REP((i), 0, (n))
#define REP(i, a, n) for(int i=(a); i<(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while(1) {
string s; getline(cin, s);
if(s == ".") break;
stack<char> st;
bool flag = true;
... | 0 | 95,641,181 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int a,b;
cin >> a >> b;
string s,t;
... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint h, w;
scanf("%lld", &h);
scanf... | 0 | 33,163,746 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans = 0;
N -= K;
ans++;
if (N == 0) {
cout << ans << endl;
}
else {
for (int i = 0; i < 1000000; i++) {
N -= (K - 1);
ans++;
if (N <= 0) {
cout << ans << endl;
break;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define endl "\n"
#define fast_io ios::sync_with_stdio(false); cin.tie(0);
#define file_io freopen("input.txt", "r", stdin); \
freopen("output.... | 0 | 87,524,204 |
#include <bits/stdc++.h>
using namespace std;
using namespace __detail;
typedef long long ll;
#define ar array
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define all(x) (x).begin(), (x).end()
#define en '\n'
#define FILL(x, v) memset(x, v, sizeof(x))
#define pb push_back
#defin... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> orderedSet;
... | 0 | 3,600,146 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ld pi = 3.141592653589793;
int n, m, p[100005];
string s[100005];
map<int, vector<string>> memo;
int main(... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int serchn,numn;
for(int a = 0;;a++){
cin >> numn >> serchn;
if(numn == 0 && serchn == 0){
break;
}
int outp = 0;
int gh = 0;
vector<int> num(numn,0);
for(int n = 0;n<numn;n++){
cin >> num[n];
}
fo... | 0 | 85,876,820 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
char a, b;
cin >> a >> b;
string sa, sb;
for (char i = '1'; i ... | #include<bits/stdc++.h>
#define LL long long
using namespace std;
LL a[1000010];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
LL n;
cin>>n;
for(LL i=1;i<=n;i++){
cin>>a[i];
}
LL j=1,s=0,ans=0;
for(LL i=1;i<=n;i++){
while(j<=n&&s+a[j]==(s^a[j])){
s+=a[j];
j++;
ans++;
}
s-=a[i];
ans+=j-... | 0 | 60,714,225 |
#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char my... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m; cin >> n >> m;
vector<vector<int> > s(m);
REP(i, m) {
int k; cin >> k;
s[i].resize(k);
REP(j, k) {
cin >> s[i][j];
s[i][j]--;
}
}
vector<int> p(m);
REP(i, m) cin >> p[i];
int res = 0... | 0 | 37,005,129 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,m;
cin >> n >> m;
vec a(n),b(m);
for(ll i=0;i<n;i++) cin >> a[i];
for(ll i=0;i<m;i++) cin >> b[i];
mat dp(n... | # include <iostream>
using namespace std;
long long N;
long long K;
long long a[100005];
long long prefixsum[100005];
long long pprefixsum[100005];
long long tempsum;
long long ans=0;
long long totalsum;
long long psum(long long left, long long right)
{
return prefixsum[right]-prefixsum[left-1];
}
long long ppsum(... | 0 | 76,541,018 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long Q,H,S,D,N,n;cin>>Q>>H>>S>>D>>n;
N=n*100;
if((Q*8<=H*4)&&(Q*8<=S*2)&&(Q*8<=D)){
cout<<Q*(N/25)<<endl;
return 0;
}
else if((H*4<=Q*8)&&(H*4<=S*2)&&(H*4<=D)){
cout<<H*(N/50)<<endl;
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
double ans = 0.0;
for (int i = 0; i < N; i++)
{
double x;
string u;
cin >> x >> u;
if (u == "BTC")
{
ans += x * 380000.0;
}
else
{
ans +... | 0 | 40,051,346 |
#include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define PI (acos(-1.0))
#define MODN 1000000007
#define MODN2 998244353
#define ALL(V) (V).begin(),(V).end()
#define INT_MAX_HALF (INT_MAX / 2)
#define EPS (1e-10)
using namespace std;
typedef long long ll;
int main(){
string o,e;
cin >> o;... | #include<iostream>
using namespace std;
int main (){
int W, H, N;
cin >> W >> H >> N;
int x[N];
int y[N];
int a[N];
for (int i = 0; i < N; i ++){
cin >> x[i] >> y[i] >> a[i];
}
int left = 0, right = W, top = H, bottom = 0;
for (int i = 0; i < N; i ++){
switch (a[i]){
case 1:
if (... | 0 | 9,158,440 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, s;
cin >> n >> s;
for(int x = 0; x <= n; ++x){
for(int y = 0; y <= n - x; ++y){
int z = n - x - y;
if(10000 * x + 5000 * y + 1000 * z == s){
cout << x << " "<< y << " " << z << endl;
... | #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 Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define ... | 0 | 13,149,792 |
#include <stdio.h>
#include <algorithm>
using namespace std;
#define INF 1e8
int a[222][222], r[11], R, ans = INF;
void update(void)
{
int i, sum = 0;
for (i = 1; i < R; i++)
sum += a[r[i]][r[i + 1]];
ans = min(ans, sum);
}
int main(void)
{
int N, M, i, j, k;
scanf("%d %d %d" ,&N, &M, &R);
for (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
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) {
... | 0 | 79,480,836 |
#include<iostream>
using namespace std;
int main(){
int n,r;
char a[1000],b[1000],x,y;
while(cin>>n,n){
for(int i=0;i<n;i++){
cin>>x>>y;
a[i]=x;
b[i]=y;
}
cin>>r;
for(int i=0;i<r;i++){
cin>>x;
int j;
for(j=0;j<n;j++)
if(a[j]==x){
cout<<b[j];
break;
}
if(j==n)
cout<<x;
... | #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 | 25,873,503 |
#include <stdio.h>
#include <string.h>
int main(){
int a,b,x,y;
char c[100];
scanf("%d",&a);
getchar();
scanf("%[^\n]",&c);
x=strlen(c);
y=x-a;
if(x>a){
for (int i=0;i<a;i++){
printf("%c",c[i]);
}
printf("...\n");
}
else{
for(int i=0;i<x;i++){
printf("%c",c[i]);
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
#define INF 1e18LL
const ll MAX = 1000000000000000000;
int main(){
string s;
cin >> s;
bool exist = true;
int cnt = 0;
... | 0 | 32,478,942 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main()
{
string s;
cin >> s;
int ans = INF;
int digit;
rep(i, 0, s.size()-2){
digit = 100;
int x = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,k;
long long int a;
const long long int INF=1LL<<60;
while (cin>>n>>k) {
if (n==0&&k==0) {
break;
} else {
std::deque<long long int> deq;
for (int i=0;i<n;i++) {
cin>>a... | 0 | 67,802,083 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
using namespace std;
#define al... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 0 | 94,781,238 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(),s.end());
string a[4]={"remaerd", "maerd", "esare", "resare"};
bool can2=false;
for(int i=0;i<s.size();){
can2=false;
for(int j=0;j<4;j++){
string d=a[j];
if(s.substr(i,d.size())==d){
c... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | 0 | 44,178,641 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
signed main() {
std::string s;
int x,y,r=0,v=0,c=0,ff=0,gg=0,ss,sc;
std::vector<int> f,g;
std::cin >> s >> x >> y;
ss=s.length();
for(int i;i<ss;i++){
c++;
if(s[i]=='F'){
x--;
} else {
break;
}
}
sc=... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
vector<int>S2(26);
vector<int>T2(26);
for(int i = 0; i < S.size(); i++) {
S2[S[i]-'a']++;
T2[T[i]-'a']++;
}
sort(S2.begin(),S2.end());
sort(T2.begin(),T2.end());
for(int i = 0; i < 26;... | 0 | 18,919,090 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cctype>
using namespace std;
#define rep(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y; cin >> x >> y;
string ans = "No";
if (y % 2 == 1) {
cout << ans << endl;
return 0;
}
if (2 * x <= y && y <= 4 * x) ans = "Yes";
cout << ans << endl;
return 0;
} | 0 | 18,141,279 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll x,z;
double y;
cin>>x>>y;
z=y*100+0.1;
ll num;
num=(ll)x*z/100;
cout<<num<<endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
long long a[5000];
bool dp[5000][10001]... | 0 | 25,629,132 |
#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 <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 0 | 74,260,527 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int main()
{
int x, a;
cin >> x >> a;
if (x<a) puts("0");
else puts("10");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int ratingNow, ratingFuture, a;
cin >> ratingNow;
cin >> ratingFuture;
a = (ratingFuture * 2) - ratingNow;
cout << a << endl;
return 0;
} | 0 | 32,962,340 |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); retur... | #include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <string>
using namespace std;
void solve();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
void solve() {
int h,w;
cin >> h >> w;
string s[h][w];
for(int i = 0; i < h; i++) {... | 0 | 92,084,059 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define ina(x, n) rep(x_i,n) cin>>x[x_i]
#define outa(x, n) rep(x_i,n) cout<<x[x_i]<<" \n"[x_i==n-1]
typedef long long ll;
typedef vector<ll> vl;
int main... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
#include <string>
#include <numeric>
#include <algorithm>
#include <utility>
using std::cout;
using std::cin;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a, ll... | 0 | 38,396,435 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll=long long;
int main(){
int n,m,sum=0;
cin >> n >> m;
vector<int> a(m);
rep(i,m){
cin >> a[i];
sum += a[i];
}
if(sum>n) cout << -1 << endl;
if(sum<=n) cout << n-sum << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
map<int, int> factor(int n){
map<int, int> res;
for (int i = 2; i*i <= n; ++i) {
... | 0 | 22,780,130 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
int main(){
int n, d, x;
cin >> n >> d >> x;
int cnt = 0;
for(int i = 0; i < n; i++){
int a;
cin >> a;
... | 0 | 44,137,836 |
#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() {
string s; cin >> s;
int n = s.size();
for(int left=0;left<n;left++) {
int right = left;
map<char, int> mp;
while(right < n && right-left <... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#include <set>
#include <cstdlib>
#include <queue>
#include <map>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<lli... | 0 | 37,471,690 |
#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;
sort(s.begin(), s.end());
if (s[0] == s[1] && s[2] == s[3] && s[1] != s[2]) cout << "Yes";
else cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typed... | 0 | 22,244,735 |
#include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
typedef uint16_t u16;
typedef int16_t i16;
typedef uint8_t u8;
typedef int8_t i8;
using namespace std;
#define rep(idx, N) for (u64 idx = 0; idx < N; idx++)
int main() {
string s;
cin >> s;
if (s[0] != s... | #line 1 "test/GRL_1_C.test.cpp"
#define PROBLEM "http:
#line 1 "macro/macros.hpp"
#include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; ... | 0 | 27,122,335 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) co... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
const ll INF = 1001001001001001001;
int main(){
int n, k;
cin >> n >> k;
vector<int> p(n+1);
for(int i = 1; i <= n; i++) cin >> p[i];
vector<int> c(n+1);
for(int i = 1; i <= n; i++) cin >> c... | 0 | 57,136,923 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
for (int i = 0; i <= 25; i++) {
for (int j = 0... | #include<bits/stdc++.h>
using namespace std;
int T;
long long a,b;
int main(){
ios::sync_with_stdio(false);
cin>>T;
while (T--){
cin>>a>>b;
if (b<a)swap(b,a);
long long l=sqrt(a*b-1);
long long r=l;
while (r&&r*(l+1)>=a*b)r--;
bool sig1=0,sig2=0,sig3=0;
... | 0 | 41,437,615 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int n;
cin >> n;
vector... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | 0 | 100,860,987 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
string ans;
for (int i=0; i<s.size(); i++) {
if (i % 2 == 0) ans += s[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
#define all(a) a.begin(), a.end()
const int MOD = 1e9+7;
const int INF = 1001001001;
int edge[8][8] {0};
int main(){
int N, M;
cin >> N >> M;
... | 0 | 72,986,527 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll X,N;
cin >> X >> N;
if(N==0){
cout << X << endl;
return 0;
}
vector<ll> P(N);
for(ll i=0;i<N;i++){
cin >> P.at(i);
}
int t=0;
for(ll i=0;i<3*N;i++){
if(i%2==0){
t=(i+1)/2;
}
else if(i%2==1)... | #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 | 48,856,604 |
#include<cstdio>
int main(){
int money;
int dat[] = {500,100,50,10,5,1};
while(1){
scanf("%d",&money);
if(money == 0)break;
int fishing = 1000-money;
int cnt = 0;
for(int i=0;i<6;++i){
if(fishing < 0)break;
int tmp = fishing/dat[i];
fishing -= tmp * dat[i];
cnt += tmp;
}
printf("%d\n",cnt);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define ALL(x) (x).begin(), (x).end()
#ifdef _DEBUG
#define PRE_... | 0 | 68,874,891 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include... | #include<iostream>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c;
cin>>k;
while(k&&b<=a)
{
b=b*2;
k--;
}
while(k&&c<=b)
{
c=c*2;
k--;
}
if(a<b&&b<c)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}... | 0 | 96,280,729 |
#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int N=200000;
void Run()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}
int a[N];
set<int>v;
int main()
{
Run();
int n;
cin>>n;
string s;
cin>>s;
if(s.size()>n)
... | #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 | 68,606,992 |
#include <bits/stdc++.h>
#define pb push_back
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main()
{
fast_in_out
string s;
cin>>s;
vector<char>con;
for(int i=0;i<(int)(s.size());i++){
if(s[i]=='B'){
if(!con.empty())con.... | #include <iostream>
#include <vector>
#include <utility>
using namespace std;
typedef pair<long long, long long> P;
int main(){
int N, K;
cin >> N >> K;
vector<long long> x(N), y(N);
for(int i = 0; i < N; i++) cin >> x[i] >> y[i];
long long ans = 5e18;
for(int i = 0; i < N; i++){
for(int... | 0 | 47,373,879 |
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define INF (1<<29)
using namespace std;
typedef long long ll;
int main(){
int n,k;
int a[100000];
while(cin>>n>>k&&n&&k){
REP(i,n)cin>>a[i];
int sum=0;
REP(i... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | 0 | 95,040,221 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;
template <typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
cout << "{";
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
cout ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W; cin >> H >> W;
vector<vector<char>> s(H,vector<char>(W));
int dw[4] ={1,0,-1,0};
int dh[4] ={0,1,0,-1};
bool can = true;
for(int h=0; h<H; h++){
for(int w=0; w<W; w++){
cin >> s.at(h).at(w);
}
}
... | 0 | 33,522,841 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<pair<string, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_pair(a, b);
}
string X;
cin >> X;
bool flag = false;
int ans = 0;
... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int v ,e;
int sta[10001];
vector <int> gin[10001];
vector <int> gout[10001];
queue <int> Q;
vector <int> ans;
void toporogical_sort(){
for(int i=0;i<v;i++)
if(gin[i].size() == 0) {
Q.push(i);
}
while(!Q.empty()) {
int t = ... | 0 | 72,455,758 |
#include <bits/stdc++.h>
#include<math.h>
#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() {
int n ;
cin >> n ;
vector<int> a (n);
int mx ;
rep(i, n){
... | #include<iostream>
using namespace std;
int main()
{
int a;
cin >> a;
if(a>=1200&&a<=3000)
{
cout << "ARC";
}else if (a<1200&&a<=3000)
{
cout << "ABC";
}
} | 0 | 60,159,955 |
#pragma warning (disable:4996)
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#define MAX 1000000
using namespace std;
int amount[MAX];
int vis[MAX];
int prime[MAX];
int main(){
memset(vis, 0, sizeof(vis));
memset(prime, 0, sizeof(prime));
... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using ... | 0 | 83,467,724 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
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(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#d... | 0 | 46,624,091 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, ... | #include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
... | 0 | 83,220,514 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)n; ++i)
using namespace std;
int main() {
int n;
cin >> n;
std::vector<int> vec(n);
std::vector<int> d(n);
rep(i,n) {
int x;
cin >> x;
x--;
vec.at(i) = x;
d.at(i) = x;
}
sort(d.begin(), d.end());
for (auto i : d) {
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | 0 | 21,309,023 |
#include <iostream>
using namespace std;
int main() {
int n, *h;
cin>>n;
h = new int[n];
for(int i=0;i<n;++i){
cin>>h[i];
}
for(int i=1;i<=n;++i){
cout<<"node "<<i<<": key = "<<h[i-1]<<", ";
if(i!=1)cout<<"parent key = "<<h[i/2-1]<<", ";
if(i*2<=n)cout<<"left key = "<<h[i*2-1]<<", ";
if(i*2+1<=n)cout<<"... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const ll LINF = 1LL<<60;
#define int long long
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, m, X; cin >> n >> m >> X;
vector<int> c(n);
vector<vector<int>> a(n, vector<int>(m));
for (int i ... | 0 | 12,026,546 |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
typedef long long ll;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v,n,m,init) vector<vector<i... | 0 | 6,520,612 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
ll in[N];
void solve() {
ll ret = 0;
int n;scanf("%d",&n);
for(int i=0;i<n;++i) {
scanf("%lld",&in[i]);
ret ^=in[i];
}
for(int i=0;i<n;++i) {
ll tmp = in[i]&ret;
in[i] -= tmp;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 0 | 1,766,674 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int k;
long long ans;
cin>>k;
queue<long long> lun;
for(int i=1; i<=9; i++){
lun.push(i);
}
for(int i=0; i<k-1; i++){
ans=lun.front();
if(ans%10!=0){
lun.push(10*ans+(ans%10)-1);
}
... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
bool ok(string s){
int n= s.length();
bool maki = true;
for(int i=0;i<n/2;i++){
if... | 0 | 98,867,008 |
#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
int main() {
#ifdef FASTIO
ios_... | #include <stdio.h>
int main(void)
{
int i, j, t, a[5];
for(i=0; i<5; i++) scanf("%d", &a[i]);
for(i=0; i<5; i++) {
for(j=0; j<4; j++) {
if(a[j] < a[j+1]) {
t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
}
printf("%d %d... | 0 | 47,443,345 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
int n,k;
cin>>n>>k;
vector<int>a(n);
rep(i,n)cin>>a[i];
int x=min(n,k),mx=0;
for(int i=0; i<=x; ++i){
for(int j=0; j<=x-i; ++j){
int sum=0;
vec... | 0 | 79,706,643 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
int n;
cin >> n;
char s[n];
rep(i,n)cin>>s[i];
int ans=n;
for(int i=1;i<n;i++){
if(s[i]==s[i-1]){
ans--;
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | 0 | 94,465,561 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
cout << endl; cout << "i= ";for(ll i=0; i<num; i++) cout << i << " ";cout << endl;
cout << " ";
if(is_reverse) f... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
int main(){
int n;
string s;
cin>>n>>s;
int type[2*n];
int cnt=0;
rep(i,2*n){
type[i]=(... | 0 | 21,164,787 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.