code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define print cout <<
#define printl(s) cout << s << endl;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(){
char N;
cin >> N;
char ans ='A';
if(N>='a' && N <='z'){
ans = 'a';
}
printl(ans);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repm(i,m,n) for(ll i=m;i<n;i++)
#define max(a,b) (((a)>(b))?(a):(b))
#define min(a,b) (((a)<(b))?(a):(b))
#define YesNo(a) (a)?cout<<"Yes"<<endl:cout<<"No"<<endl
#define YESNO(a) (a)?cout<<"YES"<<endl:cout<<"NO"<<endl
#define INF... | 1 | 68,370,425 |
#include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#de... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> kane(N+1);
for(int i = 0; i < N+1; i++){
kane[i] = i;
}
for(int i = 9 ; i < N+1; i = i*9){
for (int j = 0; j < N + 1; j++){
if (j+i < N+1){
kane[j+i] = min(kane[j+i]... | 1 | 68,784,359 |
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | #include <stdio.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
#define INF 1001;
int dis(string a, string b);
int main(void)
{
string S,T,slocal;
int ans = INF;
cin >> S >> T;
int N = S.size() - T.size() + 1;
int tlen = T.size();
int dis... | 1 | 66,227,056 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include<bits/stdc++.h>
using namespace std;
template<class T>void chmax(T& x, T y){if(x < y) x = y;}
int N;
vector<int> as;
int cnt[100];
bool flag = true;
int main(){
cin >> N;
int mx = 0;
for(int i = 0; i < N; i++){
int a;
cin >> a;
cnt[a]++;
chmax(mx, a);
}
for(in... | 1 | 90,787,884 |
#include <iostream>
using namespace std;
int main()
{
unsigned int n, b, f, r = 0;
int v, temp;
unsigned int resident[4][3][10];
string inptn;
int innum;
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 10; k++)
{
resident[i][j][k] = 0;
}
}
}
cin >> n;
for (in... | #include <iostream>
using namespace std;
int main()
{
int a1[4][11],a2[4][11],a3[4][11],a4[4][11],b,f,r,v,n,i,j,k;
cin>>n;
for(i=1;i<=3;i++)
{
for(j=1;j<=10;j++)
a1[i][j]=a2[i][j]=a3[i][j]=a4[i][j]=0;
}
for(k=1;k<=n;k++)
{
cin>>b>>f>>r>>v;
switch(b)
{
case 1:
a1[f][r] += v;
break;
case 2... | 1 | 31,910,913 |
#include <bits/stdc++.h>
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
template<class T, class U> void chmax(T &a, U b) { if (a < b) a = b; }
template<cl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 1 | 28,657,429 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector <int>
#define vl vector <ll>
#define all(v) (v).begin(),(v).end()
#define pb push_back
ll power(ll a, ll b){
ll res=1;
while(b>0){
if(b&1){res=(res*a);b--;}
a=(a*a);
b>... | 1 | 68,590,082 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
string S;
cin >> S;
int n = (int)S.size();
if( n <= 7 ){
cout << "YES" << endl;
}else{
int win = 0;
for( int i = 0; i < n; i++ ){
if( S.at(i) == 'o' ) win++;
}
if( win + (15 - n) > 7 ){
cout << ... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <climits>
#include <math.h>
#include <bitset>
#define P pair
#define X first
#define Y second
#define VSORT(v) sort(v.begin(), v.end())
#define VREV(v) reverse(v.begin(... | 1 | 51,436,912 |
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
#define ll long long
#define d double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,n;
cin>>h>>n;
int a[n]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((long long)(x).size())
#define all(x) x.begin(),x.end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl "\n"
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define setbits(x) __builtin_popcountll... | 1 | 34,313,695 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitse... | #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() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> m;... | 1 | 54,605,897 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U... | #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 ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define i_os ios::sync_with_stdio(0); cin.t... | 1 | 67,991,942 |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
const ll mod = 1000000007;
ll gcd(ll a,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K,S;
int count = 0;
cin >> K >> S;
for(int i=0; i<=K; i++)
{
for(int j=0; j<=K; j++)
{
if(0 <= S-i-j && S-i-j <= K)
{
count += 1;
}
}
}
cout << count << ... | 1 | 51,804,522 |
#include <bits/stdc++.h>
using namespace std;
int n,a[100][100],b[200],k,l,x,y,z,h,t,c;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
for(int i=1;i<=3;i++){
for(int j=1;j<=3;j++){
cin>>a[i][j];
}
}
cin>>n;
for(int i=1;i<=n;i++){
cin>>b[i];
}
sort(b,b+n);
for(int i=1;i<=n;i++){
if... | #include <iostream>
#include <vector>
int main(void){
int N;
std::string ans = "No";
std::vector<int> A(9);
std::vector<int> num(101, 1);
std::vector<std::vector<int>> C = {
{0, 1, 2},
{3, 4, 5},
{6, 7, 8},
{0, 3, 6},
{1, 4, 7},
{2, 5, 8},
{0, ... | 1 | 71,846,371 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define ff first
#define ss second
#define vll vector<ll>
#define pii pair<ll,ll>
#define sz(v) (v).size()
#define srt(v) sort(v.begin(),v.end... | #include<bits/stdc++.h>
#define ll long long int
#define ar array
#define pb push_back
#define input(arr,n) for(int i = 0; i<n; i++) cin>>arr[i]
const int mod = 1e9+7;
ll power(ll a,ll b){ll r=1;for(;b;b>>=1){if(b&1)r=r*a%mod;a=a*a%mod;}return r;}
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie... | 1 | 61,256,305 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
char c;
cin >> a >> c >> b;
if(c == '+'){
cout << a+b;
return 0;
}
else{
cout << a-b;
}
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <stack>
using namespace std;
int main() {
int a, b;
string s;
cin >> a;
cin >> s;
cin >> b;
if (s[0] == '+')cout << a+ b;
if (s... | 1 | 74,239,536 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
string s;
cin >> s;
for (Int i = 0; i < ... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int n,x[3];cin>>n;
for(int i=0;i<3;i++){
x[2-i]=n%10;
n=n/10;
}
for(int i=0;i<3;i++){
if(x[i]==1)
x[i]=9;
else
x[i]=1;
}
cout<<x[0]*100+x[1]*10+x[2]<<endl;
return 0;} | 1 | 3,173,093 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
int n, N;
cin >> n;
N = (1 << n);
vector<int> a(N);
vector<pair<int, int>> b(N, make_pair(0, 0));
for (int i = 0; i < N; ++i) cin >> a[i];
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
int n, a[1 << 18], maxi;
iiii ans[1 << 18];
signed main(){
ios_base::sync_with_stdio(0);
cin >> n;
for(int i = 0;... | 1 | 100,870,768 |
#include <iostream>
#include <cstdio>
using namespace std;
const int MAX_N = 1000000;
bool prime[MAX_N + 1];
void sieve()
{
prime[0] = prime[1] = false;
for(int i = 2; i <= MAX_N; ++i)
prime[i] = true;
for(int i = 2; i <= MAX_N; ++i)
if(prime[i])
for(int j = i * 2; j <= MAX_N; j += i)
prime[j] =... | #include <iostream>
#include <cmath>
using namespace std;
const int maxn = 1000000;
int dp[maxn];
bool ar[maxn];
int main()
{
for(int i = 2;i<=maxn;i++)
{
if(!ar[i])
{
for(int j = 2;j*i<maxn;j++)
ar[i*j] = true;
}
dp[i] = dp[i-1] + !ar[i];
}
int n;
while(cin >> n)
cout << dp[n] <<endl;
return 0;
... | 1 | 62,336,493 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
#define PI 3.14159265358979323846264338327950L
using namespace std;
using P = pair<int,int>;
using ll = long long;
using namespace std;
int main(void){
int n, m;
cin >> n >> m;
int a[n];
int ans=0;
rep(i, n){cin >> a[i]; ans+= a[i];}
... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
double a[n],sum=0;
int counter=0;
for(int i=0;i<n;i++){
... | 1 | 7,034,735 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
template <class String>
size_t levenshtein(const String &s0, const String &s1) {
size_t n0 = s0.size();
size_t n1 = s1.size();
const size_t INF = std::max(n0, n1);
std::vector<std::vector<size_t>> dp(n0 + 1, std::vector<size_... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
template<typename U>
int editDistance(const U& S, const U& T){
int n = S.size();
int m = T.size();
vector<vector<int>> dp(n+1, vector<int>(m+1, max(n, m)));
dp[0][0] = 0;
for(int i=0;i<=S.size();i++){
for(int j=0;j<... | 1 | 85,633,471 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int a,b,c; cin >> a >> b >> c;
bool ok = false;
if(a+b>=c) ok = true;
if(ok) cout << "Yes" << endl;
else cout <<... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define strall(v) (v).cbegin(),(v).cend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<class t,class... | 1 | 67,981,255 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n,m,x,y;
cin >> n>>m>>x>>y;
int xma = -1000, ymi = 1000;
int a;
rep(i, n){
cin >> ... | 1 | 88,231,066 |
#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
const int INF=mod;
const double PI=3.14159265358979323846;
using ll = long long;
using P=pair<int, int>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
#define rep(i,n) for(int i = 0; i <... | #include<bits/stdc++.h>
using namespace std;
int dx4[] = {0, 0, +1, -1};
int dy4[] = {+1, -1, 0, 0};
const int mx=1000;
char ch[mx][mx];
int visit[mx][mx],dis[mx][mx];
int n,m;
void bfs(){
queue<pair<int,int>>q;
for(int i=0;i<n;++i){
for(int j=0;j<m;++j){
if(ch[i][j]=='#'){
q.push(make... | 1 | 86,460,564 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,D,answer=0,a,b=0,count=0;
cin>>N>>D;
vector<vector<int>> X(N,vector<int>(D));
for (int i=0; i < N; ++i) {
for (int j=0; j < D; ++j) {
cin >> X[i][j];
}
}
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
b=0;
for(int k=... | 1 | 54,514,265 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n][3];
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
cin>>arr[i][j];
}
}
int dp[n][3];
dp[0][0]=arr[0][0];
dp[0][1]=arr[0][1];
dp[0][2]=arr[0][2];
for(int i=1;i<n;i++){
dp[i][0]=max(dp[i-1][1],d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
const ll mod=1e9+7;
const i... | 1 | 40,025,429 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define FALSE... | #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;++... | 1 | 48,377,237 |
#include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#include<queue>
#define ii pair<int,int>
#include <sstream>
#define lli long long int
#def... | #include <bits/stdc++.h>
using namespace std;
int main(){
int obs,rd;
cin >> obs >> rd;
map<int,long long> o_h;
map<int,int> res;
map<int,bool> mp;
int a,b;
for(int i = 0; i < obs; i++){
long long x;
cin >> x;
o_h[i+1] = x;
}
for(int i = 0; i < rd; i++){
cin >> a >> b;
if(o_h[a] <=... | 1 | 49,201,242 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
double ans;
double c = double(a), d = double(b);
ans = (c+d)/2;
if(ans - ((a+b)/2) > 0){
ans++;
}
cout << int(ans) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const ll MAX = 10000;
static const ll INFTY = 1e12;
static const ll MOD = 1e9+7;
template<class T> inline bool chmax(T& a, T b)... | 1 | 50,264,184 |
#include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll r;
cin >> r;
if (r < 1200) cout << "ABC" << endl;
else if(r<2800)
cout << "ARC" << endl;
else
cout << "AGC" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | 1 | 23,450,110 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
using namespace std;
int main(){
int N;
long Z, W;
cin >> N >> Z >> W;
vector <long> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
long ans;
if (N == 1)
ans = abs(A.at(0) - W);
else
ans = max(abs(A.at(N-1) - W), abs(A.at(N-1) ... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, Z, W;
cin >> N >> Z >> W;
vector<int> a(N);
for(int i=0; i<N; i++) {
cin >> a[i];
}
int X, Y;
if(N == 1) {
cout << abs(a[0] - W) << endl;
} else {
if(abs(a[N-1]-W) >= abs(a[N-2]-a[N... | 1 | 57,180,494 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a,a+n);
int ans = a[0];
while(a[n-2] != 0){
int flag = 0;
int s;
for(int i=0;i<n;i++){
if(flag){
a[i] = a[i]%s;
}else{
if(a[i] != 0){
s = ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
typedef long long ll;
#define press_F_to_pay_respect ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++)
#define form for(int j=0;j<n;j++)
#define fore(i,a,b) for(int i = a; i < (b); i++)
#define pb push_back
#de... | 1 | 85,586,939 |
#include <iostream>
#include <vector>
using namespace std;
class Union_Find {
private:
vector<int> id, height;
int cnt;
public:
Union_Find(int n) {
cnt = 0;
for(int i=0; i<n; i++){
id.push_back(i);
height.push_back(1);
}
}
... | #include <bits/stdc++.h>
using namespace std;
const int nax = 2e5+5;
vector<int> p(nax);
vector<int> r(nax);
int par(int a) {
return p[a] == a ? a : p[a] = par(p[a]);
}
bool IsSameSet(int a, int b) {
return par(a) == par(b);
}
void merge(int a, int b) {
if(!IsSameSet(a, b)) {
int x = par(a), y = par(b);
if(r[x] ... | 1 | 98,806,135 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> ... | 1 | 52,225,765 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>
#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(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
for(int i=0;i<n;++i){
vector<int> edges(3);
for(int j=0;j<3;++j)cin>>edges[j];
sort(edges.begin(),edges.end());
edges[2]*edges[2] == edges[0]*edges[0] + edges[1]*edges[1] ? cout<<"YES"<<endl : cout<<"NO"<<endl;
}
return EXI... | 1 | 49,918,835 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int,int> pi;
typedef tuple <int,int,int> ti;
#define forn(i,a,n) for(int i = a; i < n ; i++)
#define mem(str,a) memset(str, a, sizeof(str));
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(nullptr)
con... | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
int N=S.size();
for(int i=0;i<N;i++){
if(S.at(i)==','){
cout<<" ";
}
else{
cout<<S.at(i);
}
}
} | 1 | 84,601,432 |
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
using namespace std;
int main ()
{
int n,k,count=0,a;
cin >> n >> k;
while(n-->0)
{
cin >> a;
if(a>=k)
{
count++;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main(){
int N, K;
cin >> N >> K;
vector<int> h(N);
int ans = 0;
... | 1 | 97,223,776 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #include <iostream>
#include <map>
#include <string>
using namespace std;
uint64_t gcd(uint64_t a, uint64_t b)
{
if (a % b == 0)
{
return (b);
}
else
{
return (gcd(b, a % b));
}
}
uint64_t lcm(uint64_t a, uint64_t b)
{
return a * b / gcd(a, b);
}
int main()
{
uint64_t a, ... | 1 | 78,762,290 |
#include <bits/stdc++.h>
using namespace std;
int main(){
constexpr int N= 3;
set<int> colors;
int buf;
for(int i=0; i<N; i++){
cin >> buf;
colors.insert(buf);
}
int64_t ans= colors.size();
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
set<int>arr;
int x;
for(int i=0;i<3;i++)
{
cin>>x;
arr.insert(x);
}
cout<<arr.size()<<endl;
} | 1 | 98,154,735 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
bool b = true;
if (N % 2 == 1) {b = false;}
for (int i = 0; i < N / 2; i++) {
if (S.at(i) != S.at(i + N / 2)) {b = false;}
}
if (b) {cout << "Yes" << endl;}
else {cout << "No" << endl;}
} | #include <iostream>
using namespace std;
int main()
{
int n;
string s;
cin>>n;
cin>>s;
if(n%2==1)
{
cout<<"No";
}
else
{
int x[125] = {0},flag=1;
for(int i=0; i<n; i++)
{
x[s[i]]++;
}
for(int i=97; i<123; i++)
{
... | 1 | 11,435,290 |
#include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
int main(){
string s;
int x[2];
cin >> s >> x[0] >> x[1];
int p, dir, dist;
p = 0;
for(; p < s.size() && s[p] != 'T'; ++p) {
x[0]--;
}
vector<int> dx[2];
dist = dir = 0... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 8005;
vector<int> arr;
int dp[MAXN][2*MAXN];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
string str;
cin >> str;
arr.push_back(0);
for (int i = 0; i < (int)str.length(); i++) {
if (str[i] == 'T') arr.push_back(0);
else arr.back()++;
}
int N... | 1 | 10,676,458 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main() {
in... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | 1 | 15,972,431 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
vector<int> v(4);
vector<char> op(3);
for (int i = 0; i < 4; i++)
{
v[i] = s[i] - '0';
}
int ans = 0;
for (int bit = 0; bit < (1 << 3); bit++)
{
int ans = v[0];
for (int i = 0; i < 3; i++)
{
if (bit & (1 << i))
{
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <t... | 1 | 45,668,817 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S; int N; int count;
cin >> N >> S;
for (int i=0;i<1000;i++){
int a[3]={i/100, (i/10)%10, i%10};
int kakutei=0;
for (int j=0; j<N;j++){
if(S[j]==('0'+a[kakutei])){
kakutei++;
}
if(kakutei==3){
break;
... | #include <iostream>
#include <cstdlib>
#include <math.h>
#include <utility>
#include <algorithm>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
int ctoi(const char c){
switch(c){
case '0': return 0;
case '1': return 1;
case '2': return 2;
case '3': return... | 1 | 82,015,871 |
#include <iostream>
using namespace std;
int main()
{
int w, h;
do
{
cin >> w >> h;
if(w == 0 && h == 0)
break;
else
for(int i = 0; i < w; i++)
{
for(int c = 0; c < h; c++)
cout << '#';
cout << e... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int H, W;
string line;
while (cin >> H >> W)
{
if (H == 0 && W == 0)
{
break;
}
line = "";
for (int x = 0; x < W; x++)
{
line += "#";
}
for (int... | 1 | 28,119,694 |
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (long lo... | #include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,n,k,st,en,ans=0;
cin>>n>>k;
for(i=k;i<=n+1;i++)
{
st=i*(i-1)/2;
en=i*(2*n-i+1)/2;
ans... | 1 | 44,735,520 |
#include <iostream>
#include <string>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
void north(int* faces) {
int tmp[7];
tmp[5] = faces[1];
tmp[1] = faces[2];
tmp[3] = faces[3];
tmp[4] = faces[4];
tmp[6] = faces[5];
tmp[2] = faces[6];
memcpy(faces, tmp, sizeof(tmp));
}
void west(... | #include <iostream>
#include <string>
using namespace std;
class cD
{
public:
void N()
{
int nTemp = 0;
nTemp = nD[1];
nD[1] = nD[2];
nD[2] = nD[6];
nD[6] = nD[5];
nD[5] = nTemp;
}
void S()
{
int nTemp = 0;
nTemp = nD[1];
nD[1] = nD[5];
nD[5] = nD[6];
nD[6] = nD[2];
nD[2] = nTemp;
}
void ... | 1 | 96,493,628 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <set>
#define ll long long
#define rep(i, a, b) for (int i = int(a); i <= int(b); i++)
#define sz(a) int((a).size())
#define shit while(t--)
#define fr for(int i... | #include <bits/stdc++.h>
using namespace std;
#define nl <<'\n'
#define pi acos(-1.0);
#define ll long long
#define pb push_back
#define eb emplace_back
#define tc int t; cin>>t; while(t--)
#define fio ios_base::sync_with_stdio(0); cin.tie(0)
int main()
{
fio;
int a,b,c=0;
cin>>a>... | 1 | 79,938 |
#include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define limit 1000000000000000000
#define mod 1000000007
#define llu long long unsigned
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int a,b,c;
cin >> a;
string s;
cin >> s;
b = s.at(0)-'0';
c = (s.at(2)-'0')*10 + s.at(3)-'0';
b = b*100+c;
long long int ans = (a*b)/100;
cout << ans << endl;
} | 1 | 98,105,125 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define All(v) (v).begin(),(v).end()
int dy[8] = {-1,0,1,0,-1,1,1,-1};
int dx[8] = {0,1,0,-1,1,1,-1,-1};
const int mod = 1000000007;
const int inf = mod*mod;
const int d5 = 100100;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
str... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(),x.end()
#define mem0(s) memset(s,0,sizeof(s))
#define meminf(s) memset(s,0x3f,sizeof(s))
#define mp_insert(a,b,c) mp.insert(map<pair<int,int>,int>::value_type(make_pair(a,b),c))
d... | 1 | 11,269,189 |
#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 <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
using V=vector<int>;
using Vl=vector<ll>;
using VV=vector<vector<int>>;
usi... | 1 | 92,490,561 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, k;
cin>>n>>k;
vector<int> x(n), y(n), vx(n), vy(n);
for(int i = 0; i < n; i++){
cin... | 1 | 1,289,305 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int ans = 0, l = 0, r = s.size() - 1;
while (l < r) {
if (s.at(l) == s.at(r)) {
l++;
r--;
}
else {
if (s.at(l) != 'x' && s.at(r) != 'x') {
cout << "-1... | 1 | 64,663,956 |
#include<iostream>
using namespace std;
int a[26];
int main()
{
string s;cin>>s;
for(char c:s) a[c-'a']++;
for(auto x:a) if(x>1) return puts("no")*0;
puts("yes");
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int c[26]={};
string s;
cin >> s;
for(int i=0; i<s.length(); i++){
if(c[s[i]-'a']){
cout << "no" << endl;
return 0;
}
c[s[i]-'a']++;
}
cout << "yes" << endl;
return 0;
} | 1 | 68,974,275 |
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
int main() {
int x, y ;
cin >> x >> y;
cout << x*x-y << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A;
cin >> N;
cin >> A;
cout << (N * N) - A << endl;
} | 1 | 10,201,896 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
void add(int& a, int b) {
a += b;
if(a >= mod) {
a -= mod;
}
}
void sub(int& a, int b) {
a -= b;
if(a < 0) {
a += mod;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);... | #include<bits/stdc++.h>
#define Mx 1000000000005
#define ll long long
#define pi 3.141592653
#define vi vector<ll>
#define Mo 1000000007
#define mp make_pair
#define M map<ll,ll>
#define fr(i,a,b) for(ll i=a;i<b;i++)
#define vii vector<pair<ll,ll> >
#define fi first
#define se second
#define pb push_back
#define ld... | 1 | 42,076,069 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
double N,M;
cin >> N >> M;
double ans;
double p = 1.0/pow(2,M);
double et = 1900*M+100*(N-M);
ans = et/p;
cout << (ll)an... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou ;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii ;
#define REP(i, n) for (ll (i) = 0; (i) < (... | 1 | 73,094,984 |
#include <iostream>
#include <map>
#include <cmath>
#define ll long long
using namespace std;
int main()
{
int k, a,b;
cin >> k >> a >> b;
int result =0 ;
for(int i=1; i<=b; i++){
if(i*k>=a && i*k<=b){
result =1 ;
break;
}
}
if(result==1){
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, A, B;
bool fg = false;
cin >> K;
cin >> A >> B;
for (int i = A; i <= B; i++) {
if (i % K == 0) {
cout << "OK" << endl;
fg = true;
break;
}
}
if (!fg)cout << "NG" << endl;
} | 1 | 64,452,980 |
#include <stdio.h>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <iostream>
#include <math.h>
#include <bitset>
#include <iomanip>
#include <queue>
#include <cstring>
using namespace std;
int main() {
long long N, K,x=0,mod=1000000007; cin >> N >> K;
vector<long long>... | #pragma region
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
using namespace std;
typedef long long ll;
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i,... | 1 | 58,888,066 |
#include <bits/stdc++.h>
using namespace std;
#define long long long
#define INF ((long) 2e18)
#define MOD ((long) (1e9 + 7))
#define umap unordered_map
int main()
{
ios::sync_with_stdio(true); cin.tie(0); cout.tie(0);
long t = 1;
while (t--) {
long n, a, b;
cin >> n >> a >> b;
long ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 1 | 18,670,564 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K, L = 0;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {cin >> h.at(i);}
for (int i = 0; i < N; i++) {
if (h.at(i) >= K) {L++;}
}
cout << L << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define _rrep(i,n) rrepi(i,n,0)
#define rrepi(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS... | 1 | 67,228,820 |
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<pair<ll, ll>> pf(ll n){
vector<pair<ll, ll>> res;
for (ll i = 2; i*i <= n; i++){
if (n%i != 0){
continue;
}
else{
ll ex = 0;
while (n%i == 0){
ex++;
... | 1 | 73,274,547 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int Mod=1e9+7;
const int INF=0x3f3f3f3f;
const int __Mod=1e9+7;
int C[100000][2000];
void init(int n,int m){
for(int i=0;i<=n;++i){
C[i][0]=1;
for(int j=1;j<=i && j<=m;++j){
C[i][j]=(C[i-1][j]+C[i-1][j-1]) %__Mod;
}
}
}
int main() {
#if... | #include <iostream>
using namespace std;
#define MOD 1000000007
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int S;
cin >> S;
int dp[2005];
dp[0] = 1;
dp[1] = dp[2] = 0;
for (int i = 3; i <= S; i++) {
dp[i] = (dp[i-1] + dp[i-3])%MOD;
}
cout << dp[S]%MOD << '\n';
... | 1 | 46,784,827 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define for0(i, a, b) for(int i = a; i < b; ++i)
#define for1(i, a, b) for(int i = a; i <= b; ++i)
#define forw0(i, a, b) for(int i = a - 1; i >= b; --i)
#define forw1(i, a, b) for(int i =... | #include<bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#def... | 1 | 4,134,089 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | #include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#define rep(i, n) for (in... | 1 | 82,333,125 |
#include <iostream>
using namespace std;
int main(){
int a, b, c, d = 0;
int e, f, g, h = 0;
cin >> a >> b >> c >> d;
cin >> e >> f >> g >> h;
if (a + b + c + d > e + f + g + h){
cout << a + b + c + d << endl;
}
else if (a + b + c + d < e + f + g + h){
cout << e + f + g + h << endl;
}
else if (a + b + c + ... | #include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int a, b, i;
int sum_a, sum_b;
sum_a = sum_b = 0;
for (i = 0; i < 4; i++){
scanf("%d", &a);
sum_a += a;
}
for (i = 0; i < 4; i++){
scanf("%d", &b);
sum_b += b;
}
printf("%d\n", max(sum_a, sum_b));
return (0);
} | 1 | 5,247,612 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,0,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
int X,A,B;cin>>X>>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 1 | 50,404,502 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> sushi(n);
rep(i, n) cin >> sushi[i].second >> sushi[i].first;
sort(sushi.begin(), sushi.end());
vector<bool> type_set(n +... | 1 | 84,443,669 |
#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int MAXN = 100000 + 5;
LL a[MAXN],b[MAXN];
LL cal(const int n,const LL m){
LL res(0);
for(int i(0);i<n;++i){
if((a[i] | m) == m)
res += b[i];
}
return res;
}
LL solve(const int n,const LL m){
LL res = cal(n,m);
LL pre(m);
for(int i(0);... | #include <bits/stdc++.h>
using LL = long long;
const LL MOD = 1e9+9;
using namespace std;
const int beam_with = 20;
int main(){
int N;cin >> N;
LL _K;cin >> _K;
bitset<50> K(_K);
vector<bitset<50>> bits;
vector<LL> val;
for(int a = 0;a < N;a++){
LL A,B;cin >> A >> B;
bits.push_ba... | 1 | 36,015,897 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void a_three_letter_acronym(void) {
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
char diff = 'A' - 'a';
printf("%c%c%c\n", s1[0] + diff, s2[0] + diff, s3[0] + diff);
}
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using P = pair<int,int>;
int main(void) {
string a, b, c;
cin >> a >> b >> c;
a[0] = 'A'+a[0]-'a';
b[0] = 'A'+b[0]-'a';
c[0] = 'A'+c[0]-'a';
cout << a[0] << b[0] << c[0];
} | 1 | 23,157,632 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
long long modPow(long long a, long long n, long long p) {
if (n == 0)
return 1;
if (n == 1)
return a % p;
if (n % 2 == 1)
return (a ... | #include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | 1 | 94,042,644 |
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << x << "\n";
#define debug2(x,y) cout << x << " " << y << "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
const ll mod = 1e9+7;
const int MAX = 2e5+5;
int main() {
int n; cin >> n;
if(n % 2 == 1){
cou... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | 1 | 21,211,284 |
REP(y,2020) {
REP(x,2020) {
int X = (x + y) / 2;
int Y = (x - y) / 2;
if (0 < X && X < 3000 && 0 < Y && Y < 3000) {
ansGrid[X][Y] =grid[x][y];
}
}
}
for (int y=W; y<W+H; y++) {
for (int x=1; x<=W; x++) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#... | 1 | 99,225,626 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
bool sortbysec(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.second < b.second&&a.first<b.first);
}
void solve(){
int k,s;
cin>>k>>s;
int cn=0;
for(int i=0;i<=k;i++){
for(int j=0;j<=k;j++){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const long double PI = (acos(-1));
#define rep(i, x, n) for (int i = x; i < (int)(n); i++)
#define sc(x) scanf("%d",&x)
#define scll(x) scanf("%lld",&x)
int main(){
int k, s, ans = 0; sc(k), sc(s);
vector<int> v(k+1);
... | 1 | 60,525,144 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[i] SP;
cout << endl... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <numeric>
#include <iterator>
#include <math.h>
#include <list>
#include <bits/stdc+... | 1 | 77,101,670 |
#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>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL<<60;
const double eps = 1e-9;
int main()
{
int n;
cin >> n;
map<int, int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a[x]++;
}
int tmp = int(a.size());
... | 1 | 32,026,134 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#define MAX 1000000000
#define MIN -10000000000
#define ll long long
using namespace std;
int main() {
ll n,k,i,j,temp,last,maxx;
do {
cin >> n >> k;
if(k==0&&n==0)break;
vector<ll> a(n);
... | #include<stdio.h>
#include<algorithm>
using namespace std ;
int main()
{
int n ,k ;
while( 1 )
{
scanf( "%d %d" ,&n ,&k ) ;
if( !( n | k ) )
{
return 0 ;
}
int if_k = k - 1 ;
int ans = -10001 ,other[ 100000 ] ;
int sum = 0 ;
int i ;
for( i = 0 ; i < n ; ++i )
{
scanf( "%d" ,&other[ i ] ) ;
... | 1 | 19,623,824 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s, n) for(int i = s; i < (int)(n); i++)
#define co(x) cout<<x<<endl
#define SQvec(i,j) vector<vector<int>> data(i, vector<int>(j))
#define mod 1000000000+7
typedef long long int lint;
int main() {
double n,m,d;
double ans;
cin >> n >> m >> d;
if(d == 0)... | #include<bits/stdc++.h>
using namespace std;
static const int INF=1e9;
static const int MOD=1000000007;
typedef long long ll;
typedef pair<int,int> P;
int main(){
double n,m,d; cin >> n >> m >> d;
double ans;
if(d==0){
ans=(m-1)/n;
cout << setprecision(10) << ans << endl;
}else{
... | 1 | 59,933,048 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
char c1[3];
char c2[3];
using namespace std;
int main() {
cin >> c1[0] >> c1[1] >> c1[2];
cin >> c2[0] >> c2[1] >> c2[2];
cout << (c1[0] == c2[2] && c1[1... | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define IPT(t, x) t ipt; cin >> ipt; x.push_back(ipt);
#define YN(x) x ? cout << "YES" << endl : ... | 1 | 13,439,197 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <climits>
using namespace std;
int n, m, x;
int c[12], a[12][12];
int main()
{
cin >> n >> m >> x;
for (int i = 0; i < n; i++) {
cin >> c[i];
for (int j = 0; j < m; j++) {
cin >> a[... | #include <bits/stdc++.h>
using namespace std;
const int PMAX = 20000000;
int main(){
int N,M,X,i,j,k;
cin >> N >> M >> X;
vector<int> c(N);
vector<int> s(M);
vector<vector<int>> A(N,vector<int>(M));
for(i=0;i<N;i++){
cin >> c[i];
for(j=0;j<M;j++)
cin >> A[i][j];
}
int N2 = 1;
N2 <<= N;
... | 1 | 44,040,780 |
#include<stdio.h>
int main(){
int apple, slice;
scanf("%d%d",&apple,&slice);
printf("%d\n",(apple*3 + slice)/2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define LIMIT 1000000007
template<class H>
void CIN(H& h){cin>>h;}
template<class H, class... T>
void CIN(H &h, T&... t){cin>>h;CIN(t...);}
namespace {
#define DEBUG(...) do{cout<<#__VA_ARGS__<<" = ";debug(__VA_ARGS__);}while(0)
#define ldebug(..... | 1 | 26,429,830 |
#include<iostream>
#include<math.h>
#include<string.h>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<deque>
using namespace std;
int main(){
int x,a,b;
cin >> x >> a >> b;
int c=(-1*a)+b;
if(c<=0){
cout << "delicious" << endl;
}else if( 0<c && c<=x){
cout << "safe" << endl;
}else{
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,s;
cin>>a>>b>>c;
s=-1*b+c;
if(b>=c){
cout << "delicious" << endl;
}
else if(s<=a){
cout <<"safe"<<endl;
}
else cout <<"dangerous"<<endl;
} | 1 | 29,155,055 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define INF (1LL<<50)
signed main(){
lli n;
cin>... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define rrep(i,n) for (int i = (n - 1);i >= 0;i--)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
cin.tie(0);
ios::sync_with_stdio... | 1 | 64,902,583 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb(n) push_back(n)
#define GSORT(v) sort(v.begin(), v.end(), greater<int>())
#define SORT(v) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = 0;
for (int i = 0; i < N; i++) {
int l, r;
cin >> l >> r;
x = x + r - l + 1;
}
cout << x;
} | 1 | 10,962,448 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define float long double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define endl '\n'
#define pii pair<int, int>
#define min3(a,b,c) min(a, min(b, c))
#define max3(a,b,c) max(a, max(b, c))
#define all(x) x... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep1(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s;
cin >> s;
int n = 3;
int tem = 0;
vector<int> lan(0);
for(int l = 0; l < n;){
int r = 0;
for(; l + r < n && s[l] == s[l+r]; r++){}
if(s[l] == 'R'){
... | 1 | 20,517,206 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (i=0; i<n; i++)
int main() {
int n, k;
cin >> n >> k;
int i, ans;
ans=1;
rep(i, n) {
if (ans > k) {
ans+=k;
} else {
ans*=2;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0, k = 0;
std::cin >> n >> k;
unsigned long long int total = 1;
while (n--) {
if ((total << 1) < (total + k))
total <<= 1;
else
total +=... | 1 | 19,728,616 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
string tmp;
int ans = 0;
FOR(i,1,n+1) {
tmp = to_s... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1) return true;
for (long long i = 2; i*i <= x; i++) {
if (x % i == 0) return false;
}
return t... | 1 | 52,406,222 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | #include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main() {
int n;
stack<int> stack;
vector<int> v;
while(cin >> n) {
if(n == 0) {
v.push_back(stack.top());
stack.pop();
} else {
stack.push(n);
}
}
for(vector<int>::iterator it = v.begin(); it != v.e... | 1 | 61,920,380 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int p, q, r;
cin >> p >> q >> r;
if(min({p, q, r}) == q){
cout << min(p, q) + min(p, r) << endl;
} else{
cout << min(p, q) + min(q, r) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define repa(i,a,n) for(int i=(a);i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrepa(i,a,n) for(int i=(n)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
#define maxs(a,b) a=max(a,b);
#defin... | 1 | 85,946,570 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using lint = long long;
int main() {
int n;
cin >> n;
vector<lint> a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
lint ans = 0, tot = 0;
vector<lint> vt;
for (int i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
typedef long double ld;
#define rep(i,a,b) for(ll i=a ; i<b ; i++... | 1 | 10,777,614 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <limits>
#include <functional>
using namespace std;
int main()
{
int N,X;
cin >> N;
int f = 0;
int ans = 0, amari;
X = N;
while (N != 0)
{
amari = N % 10;
f += amari;
... | #include <bits/stdc++.h>
using namespace std;
int digit_sum(int n);
int main()
{
int N;
cin >> N;
if (N % digit_sum(N) == 0)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
}
int digit_sum(int n)
{
if (n < 10)
return n;
return digit_sum(n / 10) +... | 1 | 73,881,973 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main()
{
int n;
scanf("%d", &n);
string s, t;
cin >> s >> t;
rep(i, n) {
cout << s[i] << t[i];
}
cout << endl;
return 0;
} | #include <iostream>
#include<string>
using namespace std;
int main() {
int n;
cin>>n;
string S,T;
cin>>S;
cin>>T;
char c,m;
for(int i=0;i<n;i++){
c=S[i];
m=T[i];
cout<<c<<m;
}
return 0;
} | 1 | 4,432,669 |
#include<cstdio>
#define repi(i,a,b) for( int i = (a); i != (b); ++i )
int n, x, ans;
int main()
{
while( scanf( "%d%d", &n, &x ), n|x )
{
ans = 0;
repi( i, 1, n+1 ) repi( j, i+1, n+1 ) repi( k, j+1, n+1 )
if( i+j+k == x )
++ans;
printf( "%d\n", ans );
}
return 0;
} | #include<stdio.h>
int culculate(int n, int x) {
int i, j, k, amari, count = 0;
for (i = 1; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
amari = x - ( i + j );
if (amari >= j + 1 && amari <= n)
{
count++;
}
}
}
return count;
}
int main(void) {
int n, x;
do
{
scanf("%d %d", &n, &x);
i... | 1 | 48,464,939 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
vector<int> ns;
int temp, max_n = 0;
while(cin >> temp){
ns.push_back(temp);
max_n = max(temp, max_n);
}
max_n++;
vector<bool> is_prime(max_n, true);
vector<int> primes;
for(ll i=2;i<max_n;i++... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
vector<int> prime_num{ 2, 3 };
int n;
while (cin >> n){
int result;
if (n <= 1) {
result = 0;
}
else if (n == 2){
result = 1;
}
else if (n < prime_num.back()){
result = count_if(prime_num.be... | 1 | 95,023,715 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
LL yhaa(LL x, LL n, LL mod){
if (n == 0){
return 1;
}
if (n%2 == 0){
LL t = (yhaa(x,n/2, mod)) % mod;
return (t*t) % mod;
}
return (x * yhaa(x, n-1, mod)) % mod;
}
LL nCk(LL n,LL k,LL m){
int K;
if (... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
ll mod_pow(ll x,ll n,ll mod) {
ll res=1;
while(n>0) {
if(n&1) {
res=res*x%mod;
}
x=x*x%mod;
n>>=1;
}
return res;
}
int main() {
ll X,Y;
cin>>X>>Y;
if(X>2*Y||Y>2*X) {
cout<<0<<endl;
return 0;
}... | 1 | 21,210,901 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int x, y, z; cin >> x >> y >> z;
cout << ((z <= y && z >= x) ? "Yes" : "No") << endl;
} | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int a, b, c;
cin >> a >> b >> c;
b... | 1 | 35,331,697 |
#include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main()
{
int a;
cin >> a;
cout << (a < 1200 ? "ABC" : "ARC") << endl;
} | 1 | 96,051,076 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main () {
int n;
cin >> n;
int sum =0;
rep(i,n) {
sum += i+1;
}
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n; cin >> n;
cout << n*(n+1)/2 << endl;
} | 1 | 74,457,109 |
#include<bits/stdc++.h>
using namespace std;
struct Node{
int key;
int id,parent,left,right;
};
Node A[100000];
void heap(Node A[],int H){
for(int i=1;i<=H;i++){
if(i==1){
A[i].left=A[2*i].key;
A[i].right=A[2*i+1].key;
}
else {
A[i].parent=A[i/2].key;
A[i].left=A[2*i].key;
... | #include <bits/stdc++.h>
using namespace std;
int parent(int i) {
return i / 2;
}
int left(int i) {
return i * 2;
}
int right(int i) {
return i * 2 + 1;
}
int main() {
int h;
cin >> h;
vector<int> T(h + 1);
for (int i = 1; i <= h; i++) {
cin >> T.at(i);
}
for (int i = 1; i <=... | 1 | 25,384,666 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int MOD=1000000007;
const int INF= int(1e9);
const int MAX =1007;
string a,b;
int n,m;
int dp[MAX][MAX];
int solve ( int n,int m) {
if(dp[n][m] != -1) {
retu... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int max_len = 1005;
int dp[max_len][max_len];
char s1[max_len];
char s2[max_len];
void solve() {
int l1 = strlen(s1);
int l2 = strlen(s2);
for (int i = 0; i < max_len; i++) {
dp[i][0] = dp[0][i] = i;
}
for (int i = 0; i <... | 1 | 88,453,501 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 10;
int N, A[MAX_N];
bool check(int sigma) {
static pair<int, int> stk[MAX_N];
int top = 0;
for (int i = 1; i <= N; i++) {
int delta = A[i] - A[i - 1];
if (delta > 0) {
stk[++top] = make_pair(1, delta);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) fto(i, l, r) cout << a[i] << " "; cout << endl
#define fdto(i, r, l) for(int i = (r); i >= (l); --i)
#define fto(i, l, r) for(int i = (l); i <= (r); +... | 1 | 83,539,267 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.