code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#defin... | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a[i];
ll r=0;
rep(i,n){
r += (a[i]+1)/(n+1);
}
if(r==0){
... | 1 | 65,317,549 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
const int mod = 1000000007;
vector<ll> divisor(ll n) {
vector<ll> res;
for (ll i = 1; i * i <= n; ++i) {
if(n % i == 0) {
res.push_back(i);
if(i * i != n) res.push... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 1 | 13,410,960 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<ll, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF = ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 1 | 52,220,760 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, c, k, o, per, bus;
int a[N];
int main() {
scanf("%d%d%d", &n, &c, &k);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + n + 1);
o = 1, per = a[1], bus = 1;
for(int i = 2; i <= n; i++) {
... | #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... | 1 | 61,285,843 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | #include <iostream>
using namespace std;
void ABC120(void);
void ABC121(void);
void ABC122(void);
void ABC123(void);
void ABC124(void);
void ABC125(void);
void ABC126(void);
void ABC127(void);
void ABC128(void);
void ABC129(void);
int main(void){
ABC122();
}
void ABC122(){
char b;
cin>>b;
if(b=='A')cout... | 1 | 51,343,590 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
ll H, W;
struct cellinfo {
int x0;
int xlen;
int y0;
int ylen;
};
cellinfo ci[2001][2001];
int main(){
cin >> H >> W;
vector<string> S(H+1);
for ( int i = 0; i < H; i++ )
cin >> S[i];
S[H] = S[0];
for ( int i = 0; ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<string> field(h);
for(int i=0; i<h; i++) cin >> field[i];
vector<vector<int>> L(h,vector<int>(w,0));
vector<vector<int>> R(h,vector<int>(w,0));
vector<vector<int>> D(h,vector<int>(w,0));
vector<vector<int>> U(h,vector<int>(w... | 1 | 20,130,565 |
#include <iostream>
using namespace std;
const int MOD = 1000000007;
int N;
int dig[60];
long long A[300100];
int main() {
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
long long ans = 0, dig = 1;
for (int i = 0; i < 60; i++) {
long long zero = 0, one = 0;
for (int j = 0; j < N; j++... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 1 | 11,161,043 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ld long double
#define f first
#define mt make_tuple
#define s second
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define time_bata cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | 1 | 8,365,064 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> v(N);
for(int i=0;i<N;i++){
cin>>v.at(i);
}
sort(v.begin(),v.end());
double x=(v.at(0)+v.at(1))/2.0;
for(int i=2;i<N;i++){
x=(x+v.at(i))/2.0;
}
cout<<x<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> l;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
l.push_back(v);
}
sort(l.begin(), l.end());
long long sum = 0, tmp = 1;
sum += l[0] + l[1];
for (int i = 2; i < N; i++) {
tmp *= 2;
sum += tmp *... | 1 | 57,239,776 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S s... | 1 | 50,633,135 |
#include <iostream>
#include <string>
#include <algorithm>
using i64 = long long;
int main() {
std::string s;
std::cin >> s;
std::cout << (std::find(s.begin(), s.end(), '7') != s.end() ? "Yes\n" : "No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
char S[4];
int s=0;
cin>>S;
for(int i=0;i<3;i++){
if(S[i]=='7'){printf("Yes\n");return 0;}
}
printf("No\n");
} | 1 | 80,782,422 |
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX 100000
long long a[MAX+1];
void solve() {
int n;
long long ai, bi, k, cnt;
cin >> n >> k;
cnt = 0;
for (int i=0; i<n; ++i) {
cin >> ai >> bi;
a[ai] += bi;
}
for (int i =1 ; i <= MAX; ++i) {
cnt ... | #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 ... | 1 | 44,324,081 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+5;
int a[N][3];
int dp[N][4];
int n;
int func(int index,int last){
if(index==n) return 0;
if(dp[index][last]!=-1) return dp[index][last];
int ans=0;
for(int k=0;k<3;k++){
if(k==last) continue;
ans=max... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int n , a , b , c , dp[N][3];
int main(){
cin >> n;
cin >> dp[0][0] >> dp[0][1] >> dp[0][2];
for(int i = 1 ; i < n ; i++){
cin >> a >> b >> c;
dp[i][0] = a+max(dp[i-1][1],dp[i-1][2]);
dp[i][1] = b+max(dp[i-1][0],dp[i-1][2]);
dp[i][2... | 1 | 44,438,748 |
#include <stack>
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
#include <iomanip>
#include <string>
#include <limits>
using namespace std;
int gcd(int a, int b)
{
if (a%b == 0)
{
return(b);
}
else
{
return(gcd(b, a%b));
}
}... | #include<iostream>
using namespace std;
#define MAX_N 200010
int main() {
long long n, a[MAX_N];
long long dic[MAX_N]= {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
dic[a[i]]++;
}
long long sum = 0;
for (int i = 1; i <= n; i++) {
sum += dic[i] * (dic[i] - ... | 1 | 92,156,873 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define p... | #include <bits/stdc++.h>
using namespace std;
long long n , x[300000] , previx[300000] , ans;
map<long long , int>pos;
int main(){
cin >> n;
pos[0]++;
for(int i = 1 ; i <= n ; i++){
cin >> x[i];
previx[i] = x[i] + previx[i - 1];
pos[previx[i]]++;
if(pos[previx[i]] > 1){
ans += pos[previx[i]] - 1;
}
}
... | 1 | 36,842,836 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
int f=0;
cin>>s>>t;
for(int i=0;i<s.size();i++)
{
char h=s.at(s.size()-1);
for(int j=s.size()-1;j>=1;j--)
{
s.at(j)=s.at(j-1);
}
s.at(0)=h;
if(s==t)
{
f=1;
break;
}
}
if(f==1)
cout<<... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 1 | 44,899,288 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
int i, a, b;
cin >> a >> b;
if(a<b){
for(i=1; i<=b; i++){
cout << a;
}
cout << endl;
}
else{
for(i=1; i<=a; i++){
cout << b;
}
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define forn(i, a, b) for (int i=a; i<(signed)(b); ++i)
#define pb push_back
#define debug(x) cerr<< #x <<" : "<< x << endl;
#define debuga(A,N) cerr<... | 1 | 88,608,011 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define int... | #include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x)... | 1 | 97,133,469 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
#define MAX 10000
#define TOSEC(h,m,s) ((h)*3600+(m)*60+(s))
struct Train{
int st;
int ed;
bool operator<(const Train &t)const{
return ed > t.ed;
}
};
bool CompTrainForSort(const Train &a, const Train &b){
return a.st < ... | #include<bits/stdc++.h>
using namespace std;
int main() {
while(1){
int n;
cin >> n;
if(n==0) break;
vector<int> s(n),g(n);
vector<int> m(86400);
for(int i=0; i<n; i++){
string a,b;
cin >> a >> b;
s.at(i)=stoi(a.substr(0,2))*3600+stoi(a.substr(3,2))*60+stoi(a.substr(6,2));
g.at(i)=stoi(b.substr... | 1 | 65,901,636 |
#include<bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
int main(){
int s,t,n,m;
cin>>n>>m;
vector<vector<int> > lis(n+1000);
list<int> out;
vector<bool> V(n+1000,false);
for(int i=0;i<m;i++){
cin>>s>>t;
lis[s].push_back(t);
}
vector<int> indeg(n+1000,0);
for(int u=0;u<n;u++)... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#d... | 1 | 71,509,523 |
#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) FORR(i,0,n)
int main() {
int N, M, X;
... | #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,m,x;
cin>>n>>m>>x;
int c[n];
int a[n][m];
rep(i,n){
cin>>c[i];
re... | 1 | 73,579,166 |
#include<stdio.h>
int main(){
int w, h, x, y, r, luas1, luas2;
scanf("%d %d %d %d %d", &w, &h, &x, &y, &r);
if(x>=w || y>=h || r>x || r>y){
printf("No\n");
}
else{
printf("Yes\n");
}
} | #include <cstdio>
#include <iostream>
using namespace std;
int main()
{
int w,h,x,y,r;
cin >> w >> h >> x >> y >> r;
if (x-r>=0 && x+r<=w && y-r>=0 && y+r<=h)
cout << "Yes" << endl;
else if (x-r<=0 && x+r>=w && y-r<=0 && y+r>=h)
cout << "No" << endl;
else
cout << "No" << endl;
return 0;
} | 1 | 2,060,607 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> a(n), p(n), q(n);
rep(i, n) a[i] = i + 1;
rep(i, n) cin >> p[i];
rep(i, n) cin >> q[i];
sort(a.begin(), a.end());
int A ... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define vv(Type,Name, n,m,d)vector<vector<Type>> vv(n, vector<Type>(m, d));
using namespace std;
using ll = long long;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i];
rep(i, n... | 1 | 18,084,919 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | 1 | 20,273,700 |
#include <bits/stdc++.h>
using namespace std;
bool dfs(string &s, int p){
if(s.size() == p)
return true;
bool r = false;
string words[] = {"dream", "dreamer", "erase", "eraser"};
for(int i=0; i<4; i++){
bool ok = true;
for(int j=0; j<words[i].size(); j++)
if(words[i][j] != s[p+j]){
ok ... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | 1 | 89,785,295 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
int k=a;
string s="NO";
for(int i=0;i<b;i++){
if(k%b==c){
s="YES";
break;
}
k+=a;
}
cout << s << endl;
} | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
int main(int argc, char*... | 1 | 50,329,238 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define pb push_back
typedef long double ld;
#define fi first
#define se second
#define mp make_pair
ll inf = 1e18;
ll p = 1e9 + 7;
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
... | 1 | 41,144,898 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | #include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
using namespace std;
const int max_n= 10000;
int n,W,L,kk,m,V,e,r,ML, MD, E, v, H;
const int INF = 1e9+1;
const int mod = 1e9 + 7;
bool used[max_n][max_n];
string s1,s2;
int x[max_n],y[... | 1 | 15,243,822 |
#include<iostream>
int main()
{
int k,s,x,y,z,ans=0;
std::cin>>k>>s;
for(x=0;x<=k;x++){
for(y=0;y<=k;y++){
for(z=0;z<=k;z++){
if(x+y+z==s)ans++;
}
}
}
std::cout<<ans<<std::endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
void darts();
void longest_dis();
void sum_of_three_integers();
int main()
{
sum_of_three_integers();
}
void darts()
{
while (true)
{
int n, m;
cin >> n >> m;
if (n == 0) break;
vector<int> p(n);
... | 1 | 76,540,947 |
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <qu... | #include <bits/stdc++.h>
#include <atcoder/dsu.hpp>
using namespace std;
using namespace atcoder;
void solve(long long N, long long Q, std::vector<long long> t, std::vector<long long> u, std::vector<long long> v){
dsu d(N);
for (int i = 0; i < Q; i++) {
if (t[i] == 0) {
d.merge(u[i], v[i]);
... | 1 | 6,481,820 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int divisors(int n)
{
int ret = 0;
for (int i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret++;
if (n / i != i)
ret++;
}
}
return ret;
}
int ma... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int n;
cin >> n;
int ans = 0;
rep(i,n+1){
int j = 0;
int cnt = 0;
while(j < n){
j++;
if(j%2 == 0) continu... | 1 | 67,857,192 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
#endif
ll n,k;
cin>>n>>k;
ll hun=500;
if(n*hun>=k)
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
return 0;
} | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
int K,X;
cin>>K>>X;
if(X<=500*K)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 25,750,709 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll a, b, k;
cin >> a >> b >> k;
if(a >= k) cout << a-k << " " << b << endl;
else if(a + b <= k) cout << "0 0" << endl;
else cout << "0 " << b... | #include<bits/stdc++.h>
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define int unsigned long long
#define endl "\n"
using namespace std;
int32_t main() {
ios;
int t = 1;
while(t--) {
int a,b,k;
cin>>a>>b>>k;
if(k <= a) {
a-=k;
} else {
k-=a;
a = 0;
if(k ... | 1 | 60,189,429 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
double ans = (N - K + 1)*(N - K + 1 > 0);
for(int i = 1; i < min(N + 1, K); i++) {
for(int j = 0; j < 30; j++) {
if(i*(ll)pow(2, j) >= (ll)K) {
ans += pow(2, -1*j... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll... | 1 | 20,422,767 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int64_t FastPow(int64_t n, int64_t m){
if(m==0) return 1;
if(m==1) return n;
int64_t v=FastPow(n,m/2);
v*=v;... | 1 | 74,299,979 |
#include <stdio.h>
#include <string.h>
typedef long long ll;
int main(void) {
ll i, j, k, ans = 0, now = 0, cnt = 0;
char s[500010];
scanf("%s", s);
ll a[strlen(s) + 1];
for(i = 0; s[i]; ++i) if(s[i] == '<') {
if(!i || s[i - 1] == '>') a[i] = 0;
a[i + 1] = a[i] + 1;
}
for(--i; i >= 0; --i) if(s[i]... | #include<bits/stdc++.h>
#define ll long long
#define MAX 1000005
#define MOD (ll)(1e9+7)
#define INF INT32_MAX
#define INFL INT64_MAX
using namespace std;
void solve() {
string s;
cin >> s;
int n = s.size();
ll a[n+1];
memset(a,-1,sizeof(a));
for(int i=0; i<n; i++) {
if(i==0 && s[i]=='<') a[i]=0;
else {
if... | 1 | 85,634,882 |
#include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | #include<bits/stdc++.h>
using namespace std;
int main(){
string str;
cin >> str;
string t = "keyence";
if(str == t){
cout << "YES" << endl;
return 0;
}
int n = str.size();
for(int i = 0; i < n; i++){
for(int j = i; j < n; j++){
string S = "";
for(int k = 0; k < n; k++){
if(... | 1 | 185,600 |
#include <bits/stdc++.h>
using ll = long long;
#define mod 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF (1 << 29)
using namespace std;
void solve()
{
int n, z, w;
cin >> n >> z >> w;
int a[n];
REP(i, n) cin >> a[i];
if(n == 1) {
cout << abs(a[0] - w) << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
inline void Boost() {
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
typedef long long int ll;
typedef long double ld;
int main() {
Boost();
int n, z, w;
cin >> n >> z >> w;
vector < int > v(n);
for (int i = 0; i < n; ++i) cin >> v[i];
int ans = abs(w... | 1 | 421,709 |
#include <bits/stdc++.h>
using namespace std;
const int N=1e6;
char p[N];
int S[N],P[N],n;
int main()
{
scanf("%d",&n);
scanf("%s",p);
int i,j;
for(i=0;p[i];i++)
{
if(p[i]=='o') P[i+1]=0;
else P[i+1]=1;
}
P[n+1]=P[1];
for(i=0;i<8;i++)
{
S[0]=i&1;
S[1]=(i>>1)&1;
S[2]=(i>>2)&1;
for(j=2;j<=n+1;j++)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod... | 1 | 41,974,346 |
#include<bits/stdc++.h>
#define ll long long
#define FI freopen("input.txt","r",stdin)
#define FO freopen("output.txt","w",stdout)
#define PrintCase(i) printf("Case %d: ",i)
#define sc(a) scanf("%d",&a)
#define scl(a) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define mem(a, b) memset(a, b, sizeof(a))
#define MOD 1000000007
#define MAX (int) 1e9
#define PI 3.141592653589793238462643383279502884
template <typename T, typename U>
T max(... | 1 | 43,711,756 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> bingo(3,vector<int>(3));
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin >> bingo.at(i).at(j);
}
}
int n;
cin >> n;
vector<int> number(n);
for(int i=0;i<n;i++){
cin >> number.at(i);
}
for(int i=0;i<3;i++){... | #include <bits/stdc++.h>
#define REP(i, a, b) for(int i = (int)a; i < (int)b; i++)
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define vi vector<int>
#define ii pair<int, int>
#define ll long long int
#define MAX 20001... | 1 | 19,080,655 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
cout << "Christmas";
A -= 25;
while(A<0){
cout << " Eve";
A++;
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int d;
cin>>d;
if (d==22) {
cout<<"Christmas Eve Eve Eve"<<endl;
} else if(d==23) {
cout<<"Christmas Eve Ev... | 1 | 31,157,341 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
int main() {
ll q, h, s, d;
cin >> q >> h >> s >> d;
ll n;
cin >> n;
ll x = min({q * 8, h * 4, s * 2, d});
ll y = min({q * 4, h * 2, s});
cout << n / 2 * x + (n % 2)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
unsigned long long q,h,s,d,n;
cin>>q>>h>>s>>d;
cin>>n;
unsigned long long n1 = min(s,min(2*h,min(4*q,2*q+h)));
unsigned long long n2 = min(d, 2*n1);
if(n==1){
cout<<n1<<endl;... | 1 | 18,075,264 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
rep(i, n) rep(j,... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
int main(void){
int n,d;
cin >> n >> d;
vector<vector <int> > x(n,vector<int> (... | 1 | 55,746,965 |
#include<stdio.h>
int main(){
int a[10000],i=0;
do{
scanf("%d",&a[i]);
}while(a[i++]!=0);
for(int b=0;b<i-1;b++){
printf("Case %d: %d\n",b+1,a[b]);
}
} | #include <iostream>
using namespace std;
int main() {
auto count = 0;
while(1) {
int a;
cin >> a;
if (a == 0) break;
cout << "Case " << ++count << ": " << a << endl;
}
} | 1 | 96,064,305 |
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 1 | 49,149,694 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
for(int i = 0; i <= 7; i++){
if(!(N >= pow(2, i))){
cout << pow(2, i - 1) << endl;
break;
}
}
return 0;
} | #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... | 1 | 19,142,752 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( co... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 1 | 62,230,072 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n;
cin >> n;
double a[n];
for(int i=0;i<n;i++)cin >> a[i];
double s=0;
for(int i=0;i<n;i++)s+=1/a[i];
s=1/s;
printf("%.12f",s);
} | #include <bits/stdc++.h>
#define int 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 F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
signed main(){
int n;
long do... | 1 | 59,286,611 |
#include <stdio.h>
int main() {
char s[11];
scanf("%s", s);
int idx = 0;
for(int i = 0; s[i] != '\0'; i++) {
if(s[i] == '0') s[idx++] = '0';
else if(s[i] == '1') s[idx++] = '1';
else if(s[i] == 'B' && idx > 0) idx--;
}
for(int i = 0; i < idx; i++) {
printf("%c", s[i]);
}
return 0;
} | #include<stdio.h>
#include<string.h>
int main(){
char s[20];
scanf("%s", s);
int dex = 0;
char arr[11] = {'\0'};
int l = strlen(s);
for(int i = 0; i < l;i++){
if(s[i] == '0'){
arr[dex] = '0';
dex++;
}
else if (s[i] == '1'){
arr[dex] = '1';
de... | 1 | 46,554,331 |
#include <cstdio>
#include <cstdlib>
#include <string>
#include <iostream>
using namespace std;
int D[10000];
int H[10000];
void printResult(int i, int n){
printf("node %d: key = %d, ",i,H[i]);
if(i!=1) printf("parent key = %d, ",H[i/2]);
if(2*i<=n) printf("left key = %d, ",H[2*i]);
if(2*i+1<=n) printf(... | #include<iostream>
using namespace std;
struct Node {
int key;
int parent = -1;
int left = -1;
int right = -1;
};
Node T[251];
void prop(int num) {
int div = num / 2;
int tmp = num % 2;
T[num].parent = div;
if (tmp == 0) {
T[div].left = num;
}
else {
T[div].right = num;
}
}
int main() {
int n;
cin >> n... | 1 | 33,262,960 |
#include<bits/stdc++.h>
using namespace std;
#define PI acos(-1)
typedef long long ll;
int main()
{
string a,b;
cin >> a >> b;
if(a.size()>b.size())
{
cout<<"GREATER"<<endl;
}
else if(a.size()<b.size())
{
cout<< "LESS" <<endl;
}
else
{
for(int i=0; i<a.siz... | #include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
if(a.length()>b.length()){
cout << "GREATER" << endl;
}else if(a.length()<b.length()){
cout << "LESS" << endl;
}else{
for(int i = 0; i < a.length(); i++){
if(a[i]>b[i]){
... | 1 | 72,866,743 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int a,b,x;
cin>>a>>b>>x;
if(a<=x && a+b>=x) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (c < a) {
cout << "NO";
return 0;
} else if (a + b >= c) {
cout << "YES";
return 0;
} else {
cout << "NO";
retur... | 1 | 56,780,015 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
int n, m; cin >> n >> m;
V<bool> b(n + 1, false);
for(int i = 0; i < m; i++){
in... | #include <iostream>
#include <math.h>
using namespace std;
int mod=1e9+7;
int main(){
int N,M;
cin >> N >> M;
int s[N+1];
for(int i=0;i<=N;i++){
s[i]=0;
}
for(int i=0;i<M;i++){
int a; cin >> a;
s[a]=1;
}
int dp[N+1];
dp[0]=1;
for(int i=1;i<N+1;i++){
... | 1 | 25,751,359 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) r... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
int main() {
ll n, m;
cin >> n >> m;
ll ans;
if (n >= 3 && m >= 3)
ans = (n - 2) * (m - 2);
else if (n == 2 || m == 2)
... | 1 | 96,082,351 |
#include <iostream>
#include <utility>
using namespace std;
typedef pair<int,int> pii;
pii mx(pii a, pii b){
int i,ma1 = -1,ma2 = -1,c[4];
c[0] = a.first,c[1] = a.second,c[2] = b.first,c[3] = b.second;
for(i=0;i<4;i++){
if(ma1<c[i]){
ma2 = ma1; ma1 = c[i];
}else if(ma2<c[i]){
ma2 = c[i];
}
}
return {ma... | #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>
#include <stack>
#incl... | 1 | 82,886,368 |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cinttypes>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<stack>
#define FSCNd64 "%" SCNd64
#define FPRId64 "%" PRId64
using namespace std;
using ll=long long;
usi... | #include<bits/stdc++.h>
#include<boost/dynamic_bitset.hpp>
using namespace std;
using u64 = uint64_t;
using s64 = int64_t;
int main() {
u64 N, K;
cin >> N >> K;
vector<u64> P(N);
vector<s64> C(N);
for(u64 i=0; i<N; i++) cin >> P[i], P[i]--;
for(u64 i=0; i<N; i++) cin >> C[i];
s64 ans = INT64_MIN;
... | 1 | 91,514,121 |
#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 rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
int main(void){
string s;
cin >> s;
int ok = 0;
for (int i = 0; i < s.size(); i++){
for (int j = i; j < s.size(); j++){
if ("keyence" == s.substr(0, i) + s.substr(j))
ok = 1;
}
... | 1 | 79,260,255 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1)... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
unsigned long long ans=1;
vector<long long> a(n);
for(int i=0;i<n;i++)cin>>a.at(i);
sort(a.begin(),a.end());
if(a[0]==0){
cout<<0<<endl;
return 0;
}
for(int i=0;i<n;i++){
if(ans>(long long)1e18/a[i]){
cout<<-1<<... | 1 | 46,384,276 |
#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... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N, M;
long long X[1005], Y[1005], Z[1005];
long long dp[1005][1005][8];
int main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> X[i] >> ... | 1 | 48,899,252 |
#include <iostream>
#include <cctype>
#include <cstring>
using namespace std;
int main(){
char str[1200];
int j;
cin.getline(str, 1200);
size_t len = strlen(str);
for(j = 0; j <= len-1; j++){
if(islower(str[j]) != 0){
str[j] = toupper(str[j]);
}
else if(isupper(str[j]) != 0){
str[j] = tolower(str[j]);
... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string line;
getline(cin, line);
for (auto &it : line)
{
if (('a' <= it) && (it <= 'z'))
{
it = toupper(it);
}
else if (('A' <= it) && (it <= 'Z'))
{
it = tolower(it);
}
}
cout << line << "\n";
return 0;
} | 1 | 86,718,961 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int h, w, a,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b; cin >> n >> m >> a >> b;
string l = string(a, '0') + string(m - a, '1');
string o = string(a, '1') + string(m - a, '0');
for(int i = 0; i < b; i++) cout << l << "\n";
for(int i = b; i < n; i++) cout << o << "\n";
} | 1 | 33,021,116 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i ++){
int _a;
cin >> _a;
a[i] = _a;
}
sort(a.begin(), a.end());
int now_num = 0;
int now_cnt = 0;
int ans = 0;
for (auto num : a){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
int main(void){
ll n;
cin>>n;
map<ll,ll> m;
for(int i=0;i<n;i++){
ll a;
cin>>a;
m[a]++;
}
ll ans=0;
for(... | 1 | 97,658,613 |
#include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using v... | #include <cstdio>
#include <algorithm>
using namespace std;
const int N = 2e3 + 7;
const int M = 1e9 + 7;
int S[N], T[N], sum[N][N];
int mod(int val)
{
return (val % M + M) % M;
}
int main()
{
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i)
scanf("%d", &S[i]);
for (int i = 0; i < m; ++i)
scanf("%... | 1 | 2,218,512 |
#define _GLIBCXX_DEBUG
#include <iostream>
using namespace std;
int main(void){
int n, r;
cin >> n >> r;
if(n<10) r += 100*(10-n);
cout << r << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n,r,ans;
int main()
{
scanf("%d%d",&n,&r);
if(n<10){
ans=r+100*(10-n);
printf("%d",ans);
}else{
ans=r;
printf("%d",ans);
}
return 0;
} | 1 | 95,407,087 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF = 1e12;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
ll ans = 0;
int befo... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll ans = 0, sum = 0;
rep(i, n) {
int a;
cin >> a;
sum += a;
if (a == 0) {
ans += sum / 2;
sum = 0;
... | 1 | 83,681,023 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b;
cin >> a >> b;
if (a > 8 || b > 8)
{
cout << ":(" << endl;
}
else
{
cout << "Yay!" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string ans;
if(A > 8 || B > 8) {
ans = ":(";
} else {
ans = "Yay!";
}
cout << ans << endl;
} | 1 | 74,528,396 |
#include <bits/stdc++.h>
using namespace std;
bool hantei(int n){
bool hantei;
int cnt = 0;
while(n>0){
n/=10;
cnt++;
}
if(cnt%2==0){
hantei = false;
}else{
hantei = true;
}
return hantei;
}
int main(){
int n;
cin >> n;
int ans = 0;
for(int... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define all(a) (a).begin(), (a).end()
int main(){
int N;
cin >> N;
int count = 0;
for(int i = 1; i <= N; i++) if(to_string(i).size() % 2) count++;
cou... | 1 | 41,301,940 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<utility>
#include<string>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
using namesp... | 1 | 71,096,466 |
#include<iostream>
using namespace std;
int main(){
long long sum = 0;
int input, max = -1000000, min = 1000000, count = 0, limit;
cin >> limit;
while ( count < limit ){
cin >> input;
min = min > input ? input : min;
max = max < input ? input : max;
sum = sum + input;
count++;
}
cout << ... | #include <iostream>
using namespace std;
int main()
{
int n;
int a[10000];
int max, min;
long long sum;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
max = min = a[0];
for(int i = 0; i < n; i++){
if(min > a[i]) min = a[i];
if(max < a[i]) max = a[i];
}
cout << mi... | 1 | 77,425,036 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i) (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int L = N / 2;
int R = L + 1;
int min_L = N;
vector<pair<int, int>> P;
for (int d = 1; d < (N + 1) / 2; d += 2) {
if (P.size() < M) {
P.push_back({L + 1, R + 1});
}
min_L = min(min_L, L);
L--;
R++... | 1 | 27,602,358 |
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
vector<int> G[100001];
int dfs(int u, int p) {
int ret = 0;
for (int v : G[u]) if (v != p) ret ^= (dfs(v, u) + 1);
return ret;
}
int main() {
if (fopen("in", "r")) freopen("in"... | #include<cstdio>
#include<cctype>
#include<vector>
inline int getint() {
register char ch;
while(!isdigit(ch=getchar()));
register int x=ch^'0';
while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');
return x;
}
const int N=1e5+1;
std::vector<int> e[N];
inline void add_edge(const int &u,const int &v) {
e[u].pus... | 1 | 55,256,617 |
#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
int main(){
double a, b, c, cRad;
double s, l, h;
double pi = acos(-1);
cin >> a >> b >> cRad;
s = a * b * sin(pi / 180 * cRad) / 2;
c = sqrt( a*a + b*b - 2 * a * b * cos(pi / 180 * cRad) );
l = a + b + c;
h = 2 * s / a;
printf... | #include<iostream>
using namespace std;
#include<iomanip>
#define _USE_MATH_DEFINES
#include<cmath>
int main()
{
double a, b, t;
int C;
cin >> a >> b >> C;
t = (M_PI * C * 1.0) / 180;
cout << fixed << setprecision(10) << endl;
cout << 0.5 * a * b * sin(t) << endl;
cout << a + b + sqrt(a * a ... | 1 | 84,412,220 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <bits/stdc++.h>
using intl = long long;
using itnl = long long;
using itn = int;
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)
#defi... | 1 | 2,899,370 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i=0; i<(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
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) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef... | 1 | 59,968,389 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define LL_HALFMAX 9223372036854775807 / 2
int main()
{
ll n,k;
cin >> n >> k;
vector<ll>a(n);
for(ll i = 0; i < n; i++)
{
cin >> a[i];
}
ll result = LL_HALFMAX;
ll addcost = 0;
for(ll bit = 0; bit <(1<<... | #include <bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define REP(i, n) for(int i=0;i<(n);++i)
#define REPr(i, n) for(int i=(n)-1;i>=0; --i)
#define FORq(i, m, n) for(int i = (m);i <= (n);++i)
#define FORqr(i, m, n) for(int i = (n);i >=(m);--i)
#define PB push_back
#define MP make_pair
#define DEBUG p... | 1 | 66,758,726 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int ... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 1 | 50,329,834 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int N=1000100,P=1e9+7;
inline int read(){
int x=0,f=0,c=getchar();
for(;c>'9'||c<'0';f=c=='-',c=getchar());
for(;c>='0'&&c<='9';c=getchar())
x=(x<<1)+(x<<3)+c-'0';return f?-x:x;
}
inline void write(ll x){
if(x<0)... | #include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
us... | 1 | 20,206,002 |
#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()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
int main(){
int n; cin >> n;
vector<int> accum(n+1);
vec... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> w(n);
for(int i = 0; i < n; ++i){
cin >> w[i];
}
int res = 1000000;
int c1,c2;
for(int i = 0; i < n; ++i){
c1 = 0;
c2 = 0;
for(int j = 0; j < n; ++j){
if(j <= i){
c1 += w[j];
}else{... | 1 | 4,291,619 |
#include<iostream>
#include<algorithm>
#define REP(i,n) for(int (i) = (0);(i) < (n);++i)
using namespace std;
#define MAX_D 10000
int dp[MAX_D][MAX_D];
void LS(string a,string b)
{
REP(i,a.size()+1)dp[i][0] = i;
REP(i,b.size()+1)dp[0][i] = i;
for(int i = 1;i <= a.size() ;i++)
{
for(int j = 1;j <= b.size() ;j++)
... | #include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
char S[2][2000];
int length[2];
int changed = 0;
int dp[1500][1500];
int main()
{
cin >> S[0];
cin >> S[1];
for (int a = 0; a < 1000; a++)
{
if (S[0][a] == 0)
{
length[0] = a;
break;
}
}
length[0] = strlen(S[0]);
length[1]... | 1 | 79,840,697 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long doubl... | 1 | 24,010,007 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
#pragma warning(disable: 4996)
int main()
{
int N;
int ret;
ret = scanf("%d", &N);
vector<int> v(N);
for (int i = 0; i < N; i++) {
ret = sc... | #include <bits/stdc++.h>
#define rep(i, ns, ne) for (int i = ns; i < ne; ++i)
using namespace std;
int main() {
int N, sum, ans = 10e8;
cin >> N;
vector<int> v(N);
rep(i, 0, N) { cin >> v[i]; }
rep(i, -100, 101) {
sum = 0;
rep(j, 0, N) {
if (i != v[j]) {
sum += (i - v[j]) * (i - v[j]);
... | 1 | 82,655,246 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int h[100];
cin >> n;
for (int i = 0; i < n; i++) cin >> h[i];
int ans = 0;
while (true) {
if (*max_element(h, h + n) == 0) break;
int i = 0;
while (i < n) {
if (h[i] == 0) i++;
else... | #include <iostream>
using namespace std;
int main(void)
{
int count, a[100], i, N;
cin >> N;
for (i = 0; i < N; i++)
{
cin >> a[i];
}
count = a[0];
for (i = 0; i < N - 1; i++)
{
if (a[i] < a[i + 1])
{
count = count + a[i + 1] - a[i];
}
}
... | 1 | 57,182,930 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define MOD 1000000007
#define all(c) c.begin(), c.end()
#define rep(i, s, e) for (auto i = s; i < e; i++)
#define peek(v) \
for (auto i : v) \
cout << i << ' ';
void solve()
{
ll n, k;
cin >> n >> k;
multiset<pair<ll, ll>> ... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
ll n;
ll k;
cin >> n >> k;
vector<ll> x(100001, 0);
rep(i, n) {
ll a, b;
... | 1 | 12,384,743 |
#include <vector>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int n, m; cin >> n >> m;
vector<vector<int> > adj(n);
while (m--) {
int u, v; cin >> u >> v;
u--; v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
long long a = 0, b = 0, c =... | #include<bits/stdc++.h>
using namespace std;
const int MaxN=1e5+5;
int N,M,K,Cnt0,Cnt1;
int Fa[MaxN],Size[MaxN],Col[MaxN];
vector<int> To[MaxN];
int Get_Fa(int x){
return x==Fa[x]?x:Fa[x]=Get_Fa(Fa[x]);
}
bool Check(int u){
int i,v;
for(i=0;i<To[u].size();i++)
if(!Col[v=To[u][i]]){
Col[v]=3-Col[u];
if(!Check... | 1 | 62,260,286 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll k,n;
cin>>k>>n;
ll arr[n+5]={0};
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
ll dis=arr[0]-arr[n-1]+k;
for(int i=0;i<n-1;i++)
{
ll x=abs(arr[i+1]-arr[i]);
dis=max(dis,x);
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int L, N;
cin >> L >> N;
vector<int> A(N);
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
if (i == 0) {
B.at(i) = A.at(0) + L - A.at(N-1);
} else {
B.at(i) = A.at(i) - A.... | 1 | 57,689,855 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
int main()
{
string n;
cin >> n;
if(n[0] == '1'){
cout << "9";
}else{
cout << "1";
}
if(n[1] == '1'){
cout << "9";
}else{
cout << "1";
}
if(n[2] == '1'){
cout << "9";
}else{
cout << "1";
}
} | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#in... | 1 | 63,121,080 |
#include <algorithm>
#include <cstdio>
#include <cstring>
const int N = 1e3;
int n, m, x[N], y[N], c[2];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", x + i, y + i);
c[(x[i] + y[i]) & 1]++;
}
if (c[0] && c[1]) return puts("-1"), 0;
printf(c[0] ? "32\n1 " : "31\n");
for (int i = 30... | #include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define INF 1e18
#define MOD 1000000007
#define N 1000005
#define BB(V) V[V.size()-2]
#define ex(V) return printf(V),0
using namespace std;
pii a[1005];
vector<int>d;
char dir[5]="LUDR";
int main... | 1 | 23,577,711 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s; cin >> s;
if(s[0] == s[1] && s[1] == s[2])cout << s;
else if(s[0] >= s[1] && s[0] >= s[2]) cout << s[0] << s[0] << s[0];
else cout << char(s[0] + 1) << char(s[0] + 1) << char(s[0] + 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
for(int i = n; i <= 999; ++i){
int t = i;
... | 1 | 78,885,641 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1e9+7,INF=mod*mod*3;
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define pb push_back
ll N;
ll A[100005];
ll dp[100005];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin... | #include<bits/stdc++.h>
#define ll long long
#define fornum(A,B,C) for(A=B;A<C;++A)
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
#define INF (ll)1e18
ll N,A[202020];
ll mk[202020];
ll i, j, k,ans;
void no(){
printf("-1\n");
exit(0);
}
pll calc(ll d,ll mx){
if(d==N){
if(mx<A... | 1 | 95,897,485 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
int k;
int b;
int c;
int d;
while(cin>>n){
if(n==0){break;}
cin>>k;
int a[n];
b=0;
while(b<n){
cin >>a[b];
b=b+1;}
c=0;
b=0;
while(b<k){
c=c+a[b];
b=b+1;}
d=c;
while(b<n){
c=c-a[b-k]+a[b];
if(c>d){d=c;}
b=b+1;}
cout << d<<endl;}
} | #include<bits/stdc++.h>
using namespace std;
int N,K;
int a[100000];
int main()
{
while(scanf("%d%d",&N,&K),N||K){
for(int i=0;i<N;i++)scanf("%d",&a[i]);
int sum=0;
for(int i=0;i<K;i++)sum+=a[i];
int ma=sum;
for(int i=K;i<N;i++){
sum-=a[i-K];
sum+=a[i]... | 1 | 28,663,474 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
const int INF = 1000100100;
int main(){
ll n,cnt=0,sum=0,ans;
string s;
cin>>s;
n=s.size();
rep(i,n){
if(s[i]=='B'){
cnt++;
... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1000000009
#define LINF 1000000000000000009
#define IMOD 1000000007
#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 lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define l... | 1 | 76,190,972 |
#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 len = s.size();
if(s[0] != 'A'){
cout << "WA" << endl;
return 0;
}
int ccnt = 0;
int cind;
for(int i = 2;i <= len-2;i++){
if(s[i] ... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string S;
cin >> S;
bool ans = true;
if (S[0]!='A') ans = false;
int Ccnt = 0;
for (int i = 2; i <= S.length()-2; i++) {
if (S[i]=='C') Ccnt++;
}
if (Ccnt!=1) ans = false;
int CpCnt = 0;
for (int i = 0; i < S.length(); i++)... | 1 | 84,637,736 |
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<queue>
using namespace std;
int vis[100009];
typedef pair<int, int> P;
int main()
{
int k;
scanf("%d", &k);
deque<P> q;
memset(vis, 0, sizeof(vis));
q.push_back(make_pair(1, 1));
while(!q.empty())
... | #include <bits/stdc++.h>
#define il inline
#define rg register
using namespace std;
typedef long long LL;
const LL m_63=1061109567;
const LL m_127=2139062143;
const int inf=2147483647;
const double pi=atan(1.0)*4.0;
const LL llf=9223372036854775807;
const LL N=1e6+7;
const int M=1e6;
int n,d[N],flag[N];
int num,b[N],w[... | 1 | 33,207,040 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
int64_t result = 0;
if (N % 2 == 0) {
N /= 2;
int64_t p = 5;
while (p <= N) {
result += N /... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << " ";
#define endl "\n"
const int MOD=1000000007;
const int N=100010;
void solve(){
ll n;
cin>>n;
... | 1 | 34,352,381 |
#include <bits/stdc++.h>
#include <assert.h>
using namespace std;
long long x[100000], y[100000];
int main()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> x[i];
for (int i = 0; i < m; i++)
cin >> y[i];
long long xs = 0, ys = 0;
for (int i = 0; i < n; i++)
xs += x[i] * (i - (n - i - 1));
for... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#def... | 1 | 44,419,329 |
#include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
int len = 0;
std::vector<int> a(n), lis(n, -1);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
if (i == 0) {
lis[len] = a[i];
len++;
continue;
}
if (lis[len - 1] < a[i]) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
const int INF = 1E+9;
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) cin >> a[i];
int LIS[N];
fill(LIS, LIS + N, INF);
rep(i, N) {
... | 1 | 5,746,501 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef pair<int, int> pii;
#define INF 1e9
#define LINF __LONG_LONG_MA... | #include<bits/stdc++.h>
using namespace std ;
int main(){
string S ;
cin >> S ;
int N = S.size() ;
int cnt = 0 ;
int total = 0 ;
if(S.at(0) != 'A'){
cout << "WA" << endl ;
return 0 ;
}
for(int i = 2 ; i < N-1 ; i++){
if(S.at(i) == 'C'){
cnt++ ;
}
}
for(int i = 0 ; i< N ... | 1 | 75,739,762 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
string s;
cin >> s;
int size_s = s.length();
int sub_s, sub_e;
sub_s = -1, sub_e = -1;
for(int i=0; i<size_s-1; ++i){
if(s.substr(i, 1) == s.substr(i+1, 1)){
sub_... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n = s.length();
int a = -1, b = -1;
for(int i=0; i<n; i++){
if(i <= n-2 && s[i] == s[i+1]){
a = i+1;
b = i+2;
break;
}
if(i <= n-3 && s[i] == s[i+2]){
... | 1 | 76,147,843 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
typ... | #include <bits/stdc++.h>
#include <tuple>
#include <iterator>
using namespace std;
using ll = long long;
char t[][5] = {
{},
{'.', ',', '!', '?', ' '},
{'a', 'b', 'c'},
{'d', 'e', 'f'},
{'g', 'h', 'i'},
{'j', 'k', 'l'},
{'m', 'n', 'o'},
{'p', 'q', 'r', 's'},
{'t', 'u', 'v'},
{'w'... | 1 | 38,007,324 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.