code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
int ans = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
}
int saishou = a[0];
for(int i = 0; i < n; i++){
saishou = min(a[i], saishou);
if(a[i] == saishou){
ans++;
}
}
cout << ans << endl;
} | #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<ll,ll>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element... | 0 | 11,020,700 |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#define INF 2147483647
#define IN 2047483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
#define IOS cin.sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, a, b) for (int i = a;i<=b;i++)
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(x) (int)x... | 0 | 34,527,869 |
#include<iostream>
#include<string>
#include <cmath>
#include <typeinfo>
#define FOR(i,a,b) for(int i = a;i<=b; i++)
#define days 5*1e15
using namespace std;
string convertString(string a){
string ans;
long long b = stoi(a);
double sum = (pow(10,b) - 1)/9;
b *= sum;
ans = to_string(b);
return an... | #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 ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pragm... | 0 | 71,289,830 |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | #include <iostream>
using namespace std;
typedef long long ll;
ll n,m,l,r,d,fa[200001],ra[200001],diff_weight[200001];
ll find(ll x){
if(fa[x]==x)return x;
ll xx=find(fa[x]);
diff_weight[x]+=diff_weight[fa[x]];
return fa[x]=xx;
}
ll weight(ll x){
find(x);
return diff_weight[x];
}
bool uni(ll x,l... | 0 | 2,033,772 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
int main() {
intt N; std::cin >> N;
std::vector<intt> a(N);
for (auto& r : a) std::cin >> r;
intt count = 0;
intt t = 1;
while (true) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define MAX 4000000
vector<int> A(MAX + 1);
vector<int> B;
int H = 0;
int parent(int i)
{
return floor((double)i / 2.0);
}
int left(int i)
{
return i * 2;
}
int right(int i)
{
return i * 2 + 1;
}
void maxHeapify(int i)
{
int l = left(i);
int r = right(i);
int la... | 0 | 58,515,523 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#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;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
for(;;){
scanf("%d",&n);
if(n==0) break;
vector<int> upuse(n);
int ins;
scanf("%d",&ins);
upuse[0]=ins;
int ma=ins;
for(int i=1;i<n;i++){
scan... | 0 | 30,482,665 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
class MaxHeap
{
public:
MaxHeap() : size_(0)
{
heap_ = vector<int>(1000);
}
MaxHeap(vector<int> v) : heap_(v), size_(v.size())
{
buildHeap();
}
void insert(int key)
{
if (size_ == (int)heap_.size()) {
... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <utility>
#include <algorithm>
#include <cmath>
#include <array>
#include <bitset>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
#define R... | 0 | 14,138,682 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <iomanip>
#include <sstream>
using namespace std;
#define ll long long
#define eps 1e-7
#define inf 0x1fffffff
#de... | #include<iostream>
#include<map>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<600)
cout<<"8\n";
else if(n<800)
cout<<"7\n";
else if(n<1000)
cout<<"6\n";
else if(n<1200)
cout<<"5\n";
else if(n<1400)
cout<<"4\n";
else if(n<1600)
cout... | 0 | 20,824,449 |
#include <bits/stdc++.h>
#define eps 1e-3
#define pi acos(-1.0)
#define inf 0x3f
#define INF 0x3f3f3f3f
#define pb push_back
#define debug1 cout<<"&&";
#define debug2 cout<<"**";
#define ms(a, x) memset(a, x, sizeof(a))
#define for0(i, n) for(int i = 0; i < n; ++i)
#define for1(i, n) for(int i = 1; i <= n; ++i)
using n... | #include<cstdio>
#include<algorithm>
using namespace std;
long long n,K;
inline char nc(){
static char buf[100000],*p1,*p2;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read(){
int ret=0;bool f=0;char ch=nc();
while(ch>'9'||ch<'0') f^=ch=='-',ch=nc();
while(ch<='9'&&ch>='0'... | 0 | 71,226,554 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define INF (int)1e09
using std::cin;
using std::cout;
using std::endl;... | #include<iostream>
using namespace std;
int main(void){
int H, W, i, j;
while(true){
cin >> H >> W;
if(H == 0 && W == 0)break;
for(j = 0;j < H;j++){
for(i = 0;i < W;i++){
if(i == W - 1)cout << "#" << endl;
else{cout << "#";
... | 0 | 38,882,486 |
#include<iostream>
#include<vector>
#include<algorithm>
#include <bitset>
using namespace std;
bool ok(vector<int> &v,int g){
bitset<32000> cur;
cur[16000] = 1;
for(int i=0;i<v.size();++i){
cur = ((cur << v[i]) | (cur >> v[i]));
}
return cur[16000+g];
}
int main(){
string s;
int gx,gy;
cin >> s;
cin >> gx >>... | #include <bits/stdc++.h>
#define Tayeb ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
using namespace std;
int main()
{
Tayeb;
int count=0;
string S;
cin >> S;
for(int i=0; i<S.length(); i++)
{
if(S[i]=='R'&&S[i+1]=='R'&&S[i+2]=='R')
{
count=3;
... | 0 | 67,970,217 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include<set>
using namespace std;
int main()
{
const int M = 1000005;
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
vector<int> cnt(M);
for (int i = 0; i < N; ++i)
{
if (cnt[a[i]] != 0... | #include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
using namespace std;
#define N 100000
#define MAX 1000000000
int main() {
int cnt = 0;
long long q = 1;
while(cnt++ < 10) {
string ans;
stringstream ss;
ss << "? " << q;
cout << ss... | 0 | 4,591,980 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
char c;
cin >> c;
cout << (isupper(c)?'A':'a');
return 0;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N,M;
char c;
int A[55][55];
int B[55][55];
cin >> N >> M;
rep(i, N)... | 0 | 85,670,828 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main()
{
for (;;) {
string str;
getline(cin, str);
if (str == ".")
break;
stack<int> s;
string::iterator i;
for (i = str.begin(); i != str.end(); ++i) {
if (*i == '... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <ctime>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
... | 0 | 12,302,580 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int n;
cin >> n;
if(n == 1){
cout << 1 << endl;
}else if(2 <= n && n <= 3){
cout << 2 << endl;
}else if(4... | #include<iostream>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include <algorithm>
#include <set>
#include<math.h>
#include<cmath>
#include<vector>
#include<map>
#include<random>
#include<sstream>
using namespace std;
int main(){
string t;cin >> t;
string ty,tm,td={};
int j = 0;
for(int i = 0... | 0 | 25,008,554 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,s=0,t=0;
for(int i=1; i<=4; i++){
cin>>a;
s+=a;
}
for(int i=1; i<=4; i++){
cin>>b;
t+=b;
}
if(s>=t)
cout<<s<<endl;
else
cout<<t<<endl;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | 0 | 84,322,298 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
int a[n];
for (int i = 0; i < n; i++) scanf("%d",&a[i]);
int p[n][18]; memset(p,-1,sizeof(p));
int l;
scanf("%d",&l);
int cur = 0;
for (int i = 0; i < n; i++){
while (cur < n && a[cur] - a[i] <= ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))... | 0 | 92,196,292 |
#include <bitset>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef ... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 28,201,004 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 30,859,025 |
#include <bits/stdc++.h>
#include <algorithm>
#include <map>
#include <cstdlib>
#include <cmath>
#include <bitset>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#define inf 1e9+7
using namespace std;
typedef long long ll;
const double pi=acos(-1);
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <functional>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <vector>
#include <array>
#include <tuple>
#include <utility>
#include <numeric... | 0 | 21,448,896 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <iostream>
using namespace std;
int main() {
int A,B,C,K;
cin >> A >> B >> C >> K;
if (A>K) {
cout << K <<endl;
}
else {
if (A+B>=K) {
cout << A << endl;
}
else {
cout << A-(K-A-B) << endl;
}
}
} | 0 | 9,097,184 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k; cin >> n >> k;
map<ll, ll> mp;
for (ll i = 0; i < n; i++) {
ll a, b; cin >> a >> b;
mp[a] += b;
}
ll cnt = 0;
ll ans;
for (auto u : mp) {
cnt += u.second;
if (k <= cnt) {
ans = u.first;
break;
}
}
cout << ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n>=400 && n<=599){
cout<< "8"<<endl;
}
else if(n>=600 && n<=799){
cout<< "7"<<endl;
}
else if(n>=800 && n<=999){
cout<< "6"<<endl;
}
else if(n>=1000 && n<=1199){
cout<< "5"<<... | 0 | 64,133,548 |
#include <bits/stdc++.h>
#define cina(a, n) for (int i = 0; i < n; ++i){ cin >> a[i]; }
#define ll long long
#define ld long double
using namespace std;
int main () {
int x, n, p[102];
memset(p, 0, sizeof(p));
cin >> x >> n;
for (int i = 0; i < n; ++i) {
int s;
cin >> s;
p[s] = 1;
}
int i = 0;
while (1) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N; cin >> N;
vector<ll> a(N); ll S = 0;
vector<ll> r(N); vector<ll> e(N);
ll ans = 0;
for(int i = 0; i < N; i++){ cin >> a[i];}
while(true){
bool flag = true;
ll res = 0;
for(int i = 0; i < N; i++){
res = max(res,... | 0 | 24,641,431 |
#include<iostream>
#define ll long long
int main(){
ll n;
std::cin >> n;
n--;
ll res = (n*(n+1))/2;
std::cout << res;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
template <class T, class F>
T UpperBound(T i0, T i1, F f) {
while (i0 < i1) {
T i = i0 + (i1 - i0) / 2;
if (f(i)) i0 = i + 1; ... | 0 | 84,659,045 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
puts(a == b && a == c ? "Yes" : "No");
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
void solve(int W, int H, int N, vector<int> x, vector<int> y, vector<int> a) {
int left(0), right(W), top(H), bottom(0);
REP(i, N) {
switch (a[i]) {
case 1:
left = max(left, x[i]);
break;
case 2:
... | 0 | 16,215,109 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll INF = 1'010'000'000'000'000'017LL;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll cnt = 0;
rep(r, N + 1) {
rep(g, N + 1)... | 0 | 66,056,769 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repr(i,x,n) for(int i=x; i<(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define INF 1e9
typedef long long ll;
using VI = vector<int>;
using VS = vector<string>;
using graph = vector<vector<int>>;
int main()
{
int x;
cin>>x... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() ret... | 0 | 95,002,161 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
typedef long long ll;
ll a[N],b[N];
int n;
ll sum1,sum2;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%lld",a+i);
for(int i=1;i<=n;i++)scanf("%lld",b+i);
for(int i=1;i<=n;i++){
if(a[i]>b[i])sum1+=(a[i]-b[i]);
... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
static const int INF = INT_... | 0 | 35,891,935 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
double x, a = 0;
string u;
REP(i,n) {
cin >> x >> u;
if (u == "JPY") a += x;
else a += x * 380000;
}
cout << a << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--... | 0 | 82,814,002 |
#include <iostream>
using namespace std;
int main() {
char c;
cin>>c;
char cc=c++;
cout<<c<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 93,332,327 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int sum = 0, x, total, ans;
vector<int> p1(0);
vector<int> p2(0);
int n;
while(1){
cin >> n;
if(n==0)
break;
for(int i=0; i<n; i++){
cin >> x;
p1.push_back(x);
}
int m... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd... | 0 | 78,653,675 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i <= (int)(n); ... | 0 | 56,955,130 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string A;
cin >> A;
reverse(A.begin(),A.end());
cout << A <<"\n";
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h)
cin >> s[i];
vector<vector<vector<int>>> id(h, vector<vector<int>>(w, vector<int>(2)));
vector<vector<int>> hl(h), vl(w)... | 0 | 26,204,170 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
int sum = 0;
int d = 10000000;
int a,b,c;
int x;
cin >> n;
for(i = 0 ; i < 8 ; i++)
{
a = d*10;
b = n/a;
c = b*10;
sum += n/d - c ;
d /= 10;
}
x = n/sum;
if (sum != 0 && x*sum == n)
cout << "Yes" << endl;
else
cout << "No" << e... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(){
int N, M; cin >> N >> M;
long long alone = 0, bi = 0, crowd = 0;
vector<vector<int>> g(N);
for(int i=0;i<M;i++){
int a, b; cin >> a >> b;
--a; --b;
g[a].push_back(b);
... | 0 | 99,411,660 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int x,n;
cin >> x >> n;
vector<int> p(n);
REP(i,n) cin >> p[i];
map<int,bool> mp;
REP(i,300) mp[i-100]... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | 0 | 17,115,693 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define mod 998244353
#define sz(v) (int)(v).size()
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin.tie... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int a[5];
for(int i= 0;i<5;i++) cin >>a[i];
int sai = 10;
int soko = 0;
for(int i= 0;i<5;i++){
if(a[i]%10 == 0)continue;
if(a[i]%10 <= sai){
sai = a... | 0 | 13,647,236 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace __gnu_pbds;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
int ans;
for(int i = S.length() - 2; i >= 0; i -= 2) {
bool checker = false;
for(int j = 0; j < i / 2; j++) {
... | 0 | 75,394,751 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,ans=0,mod=1000000007;
bool b=true;
cin >> n;
vector<long> t(n),a(n),max(n);
vector<bool> ika(n,true);
for(long i=0;i<n;i++) cin >> t[i];
for(long i=0;i<n;i++) cin >> a[i];
max[0]=t[0];
ika[0]=false;
for(long i=1;i<n;i++) {
max[i]=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
ll N, K;
cin >> N >> K;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll limit = pow(10, 9)+7;
ll ans = 0;
ll cnt = 0;
rep(i, N){
for(int j = i + 1; j < N; j++){... | 0 | 60,351,156 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define P pair<ll,ll>
#define fs first
#define sc second
template<clas... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
const int M = 2;
i... | 0 | 35,119,168 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <numeric>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = n-1; i ... | #include <bits/stdc++.h>
using namespace std;
#ifdef CLION
ifstream ifs("/home/kyuridenamida/CLionProjects/untitled4/input.txt");
#define cin ifs
#endif
int main() {
long long N;
cin >> N;
set<long long> S;
for (long long i = 1; i * i <= N; i++) {
S.insert(i);
S.insert(N / i);
}
... | 0 | 91,287,867 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 60)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
templa... | #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;
vector<int> v(n);
rep(i, n)cin >> v[i]... | 0 | 77,339,687 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | 0 | 2,038,472 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> class Weighted_UnionFind {
public:
int n;
vector<int> par, nrank;
vector<T> wd;
Weighted_UnionFind(int node_size) : n(node_size), par(n), nrank(n, 0), wd(n, 0) {
iota(par.begin(), par.end(), 0);
}
int root(int x) {
if (par.at(x) == x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#defi... | 0 | 2,488,887 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << i << " "; cerr << endl;} while(0)
#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(__V... | #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>
... | 0 | 41,382,490 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
char s;
cin >> s;
if(isupper(s)) cout << 'A';
else cout << 'a';
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <random>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const ll INF = 10000000000;
... | 0 | 53,849,076 |
#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 <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
using namespa... | 0 | 85,724,078 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long S;cin>>S;
if(S==1000000000000000000ll)
{
puts("0 0 1000000000 0 0 1000000000");
return 0;
}
cout<<"0 0 ";
int t=1000000000,v=S/t;
int vvv=S%t;
cout<<t<<' '<<1<<' ';
cout<<(t-vvv)<<' '<<(v+1)<<endl;
} | #include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
... | 0 | 3,732,970 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000000
int main(){
int N;
cin>>N;
vector<long long> A(N);
long long X = 0;
for(int i=0;i<N;i++){
cin>>A[i];
}
vector<int> cnt(60,0);
for(int i=0;i<N;i++){
for(int j=... | 0 | 60,237,240 |
#include <iostream>
#include <string>
using namespace std;
int main() {
for (;;) {
int x;
int y;
cin >> x >> y;
if (x == 0 && y == 0) break;
if (x > y) {
int a = x;
int x = y;
int y = a;
cout << x << " " << y << endl;
}
else {
cout << x << " " << y << endl;
}
}
return 0;
} | #include<cstdio>
#include<cstring>
#define MIN(X,Y) ((X)>(Y)?(Y):(X))
int r[1000], c[1000];
int dp[200][200];
int main(void) {
int n;
scanf("%d",&n);
for(int i=0; i<n; i++)
scanf("%d%d",&r[i],&c[i]);
memset(dp, 0x7F, sizeof(dp));
for(int i=0; i<n; i++)
dp[i][i] = 0;
for(int i=0; ... | 0 | 4,469,695 |
#include <stdio.h>
#include <deque>
#include <utility>
using namespace std;
using ll = long long;
ll max(ll x, ll y) {
if (x < y) {
return y;
} else {
return x;
}
}
int main(void) {
ll ans = 0;
deque<pair<char, int>> v = {make_pair(getchar(), 1)};
int d;
while ((d = getchar()) != EOF) {
if (d != '<' && d !... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef ve... | 0 | 74,434,384 |
# include <cstdio>
const int MAX = 250 + 5;
int n, a[MAX];
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int p, l, r;
for (int i = 1; i <= n; i++) {
printf("node %d: ", i);
printf("key = %d, ", a[i]);
p = i / 2;
if (p != 0) {
... | #include <iostream>
#include <string>
#include <map>
#include <queue>
#include <algorithm>
#include <vector>
#include <math.h>
#include <bitset>
#include <cmath>
#include <set>
#define rep(i,s,n)for(int i = s;i<n;i++)
#define repe(i,s,n)for(int i = s;i<=n;i++)
#define rep_r(i,s,n)for(int i = n-1;i>=s;i--)
#define rep_r... | 0 | 80,366,363 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s, t; cin >> s >> t;
bool ok = false;
for(int i = 0; i < s.size(); i++){
char c = s.at(s.size()-1);
s.pop_back();
s = c + s;
if(s == t){
ok = true;
break;
}
}
if(ok) cout << "Yes" << endl;
else cout << "No" << e... | #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;
int main(){
int N,M; cin>>N>>M;
vector<vector<char>> img(N,vector<char>(N)), tmpl(M,vector<char>(M));
rep(i,0,N)... | 0 | 95,421,967 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n) - 1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
const long long MOD = 1e9+7, INF = 1e18;
t... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll n,a,b,ans=0;cin>>n;
ll m=sqrt(n);
for(ll i=1;i<=m;++i){
if(n%i==0){
a=i-1;
b=n/i-1;
if(b>1 && n%b!=0 && b!=a)ans+=b;
}
}
cout<<ans<<endl;
return 0;
} | 0 | 77,546,890 |
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define mod 1000000007
#define pi 3.1415926535
typedef long long ll;
int main(){
int H,W;
cin>>H>>W;
vector<vector<char>>C(H,vector<char>(W))... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 0 | 69,906,634 |
#include<bits/stdc++.h>
using namespace std;
#define DIV 1000000007
long long N, K;
long long mini[200005];
long long maxi[200005];
int main(){
cin >> N >> K;
for(long long i = 0; i < N+1; i++) {
mini[i+1] = i + mini[i];
mini[i+1]%=DIV;
}
for(long long i = 0; i < N+1; i++) {
maxi[i+1] = (N - i) + maxi[i];
m... | #include<iostream>
#include<vector>
#include<string>
const int MOD = 1000000007;
int main(){
int n, m;
std::cin >> n >> m;
std::vector<bool> notUsed(n + 1, false);
for(int i = 0; i < m; i++){
int a;
std::cin >> a;
notUsed[a] = true;
}
std::vector<int> dp(n + 1, 0);
dp... | 0 | 35,152,622 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll,ll> pairs;
typedef vector<pairs> p;
ll gcd(ll A,ll B){
if (A%B==0)return(B);
else return(gcd(B,A%B));
}
ll keta(ll N){
int tmp{};
... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 47,122,116 |
#include <bits/stdc++.h>
#define DEBUG 1
using namespace std;
namespace output{
void __(short x){cout<<x;}
void __(unsigned x){cout<<x;}
void __(int x){cout<<x;}
void __(long long x){cout<<x;}
void __(unsigned long long x){cout<<x;}
void __(double x){cout<<x;}
void __(long double x){cout<<x;... | #include<stdio.h>
int main(){
int i, n, s;
while (1) {
scanf("%d", &n);
if (n==0) {
break;
}
int ans = 0, maxv = 0, minv = 1000;
int score[n];
for (i = 0; i < n; i++) {
scanf("%d", &s);
if (s > maxv) {
maxv = s;
}
if (s < minv) {
minv = s;
... | 0 | 73,219,373 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int mod = 1e9 + 7;
int main() {
string s1, s2;
cin >> s1 >> s2;
int n = (int)s1.size();
int m = (int)s2.size();
if (n > m) {
cout << "GREATER";
return 0;
}else if (n < m) {
cout << "LESS";
return 0;
}
for (int i = 0; i < n; ++i) {
if ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#defin... | 0 | 99,998,904 |
#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;
string s;
cin >> n;
cin >> s;
string ans;
int k=0;
string ss;
rep(i,n){
ss=s[i];
if(ss=="("){
++k;
... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(int)(n);i++)
using namespace std;
using p=pair<int,int>;
int main(){
int h,w,n;
cin>>h>>w>>n;
vector<int> row(h),col(w);
set<p> map;
rep(i,n){
int r,c;
cin>>r>>c;
r--;c--;
row[r]++;col[c]++;
map.emplace(r... | 0 | 63,588,779 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i=0; i<n; i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
cout << accumulate(arr.begin(), arr.begin()+k, 0);
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 67,790,617 |
#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 SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((&a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " <... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, Y;
cin >> N >> Y;
Y /= 1000;
in... | 0 | 74,205,865 |
#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>;
ll x = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
for (ll i = k; i <= n+1; i++) {
ll a = 0;
a += -1 * i * i;
a += i * (n+1) + 1;
ans += a;
... | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
using namespace std;
#define al... | 0 | 2,480,302 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<int> a(s.size()+1,-1);
if (s[0] == '<') { a[0] = 0; }
if (s[s.size() - 1] == '>') { a[s.size()] = 0; }
for (int i = 0; i < s.size()-1; i++) {
if (s[i] == '>' && s[i + 1] == '<') {
a[i + 1] = 0;
}
}
for (int i = 0; i <= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
int main() {
int N; cin >> N;
... | 0 | 50,323,258 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a =... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end(), greater<int>());
long long int l1 = 0, l2 = 0;
int i = 1;
for(; i < n; i++){
if(a[i-1] =... | 0 | 97,130,973 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
map<char,int>mp;
mp['q']=0;
mp['w']=0;
mp['e']=0;
mp['r']=0;
mp['t']=0;
mp['a']=0;
mp['s']=0;
mp['d']=0;
mp['f']=0;
mp['g']=0;
mp['z']=0;
mp['x']=0;
mp['c']=0;
mp['v']=0;
mp['b']=0;
mp['y']=1;
mp['u']=1;
... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 0 | 64,353,455 |
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long llong;
#define MAX 100
const llong mod = 1000000000 + 7;
int main()
{
char S[MAX];
int N;
int isA = 1, isB = 1, isC = 1;
scanf("%s", S);
N = strlen(S);
for (int i = 0; i < N / 2; i++)
{
if (S[i] != S[N - 1 - i])
isA = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | 0 | 3,472,620 |
#include <bits/stdc++.h>
using namespace std;
bool graph[8][8];
int dfs(int v, int N, bool visited[8]){
bool all_visited=true;
for(int i=0;i<N;i++){
if(visited[i]==false){
all_visited=false;
}
}
if(all_visited){
return 1;
}
int ret = 0;
for(int i = 0; i<N;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin>>n;
ll arr[n];
map<ll,ll, greater<ll>>mp;
for(ll i=0; i<n; i++ )
{
cin>>arr[i];
mp[arr[i]]++;
}
ll c=0;
ll ar=1;
ll f=0;
for(auto it=mp.begin(); it!=mp.end(); ++it)
{... | 0 | 68,434,405 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for(int i = a; i < b; ++i)
type... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | 0 | 44,589,615 |
#include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main()
{
int num1,num2,num3,num4,num5,num6,num7,num8,num9,num10;
cin>>num1>>num2>>num3>>num4>>num5>>num6>>num7>>num8;
num9=num1+num2+num3+num4;
num10=num5+num6+num7+num8;
if(num9>=num10){
cout<<num9;
}
if(num9<num10){
cout<<num10;... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <cstdlib>
#include <cctype>
#include <ctime>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <utility>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include... | 0 | 14,752,835 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
... | 0 | 22,311,350 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int H, W;
long long int ans;
cin >> H >> W;
if (H == 1 || W == 1)
ans = 1;
else
{
ans = H * W / 2;
if (H % 2 == 1 && W % 2 == 1)
ans += 1;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
double n, m;
... | 0 | 166,282 |
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#inc... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
int n = s.size();
rep(bit, 1 << n - 1)
{
int sum = s[0] - '0';
vector<char> op(n - 1);
rep(i, n - 1... | 0 | 32,381,592 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
for(int i=0; i<s.size(); i++){
if(i==n){cout << "...";
break;}
else cout << s[i];
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int dice[6];
int n;
int x,y;
for(int i=0;i<6;i++){
cin>>dice[i];
}
cin>>n;
for(int i=0;i<n;i++){
cin>>x>>y;
if((x==dice[3] && y==dice[1]) || (x==dice[4] && y==dice[3]) || (x==dice[2] && y==dice[4]) ||(x==dice[1] && ... | 0 | 67,088,167 |
#include <iostream>
using namespace std;
int main() {
for (;;) {
int H, W;
cin >> H >> W;
if (H == 0 && W == 0) {
break;
} else {
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
cout << "#";
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
cin.tie(0); ios::sync_with_stdio(false);
ll n;
cin >> n;
string s, t;
cin >> s >> t;
for(ll i=0; i<=n; i++) {
bool ok = true;
for(ll j=0; j<n && i+j<n; j++)
ok &= s[i+j] == t[j];
... | 0 | 41,318,706 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<int,int>m;
map<int,int>::iterator it;
while(n--){
int a;
cin>>a;
it = m.find(a);
if(it!=m.end()) it->second+=1;
else m.insert(make_pair(a,1));
}
if(m.size()%2) cout<<m.size();
else cout<<m.size()-1;
} | 0 | 45,163,076 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[100100];
ll ans[100100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m;
cin>>n>>m;
ll a[n+2];
dp[1]=0;
for(ll i=2;i<=n+1;i++)
{
cin>>a[i];
dp[i]=dp[i-1]+a[i];
}
ans[1]=... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)... | 0 | 98,617,246 |
#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void c_not_so_diverse(void) {
int n, k;
int *a;
cin >> n >> k;
a = (int*)(calloc(n, sizeof(int)));
for (int i = 0; i < n; i++) cin >> a[i];
int* b;
b = (int*)(calloc(n+1, sizeof(int)));
for (int... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 76,375,715 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 0 | 10,830,606 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<int>>;
#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--)
#define pb ... | 0 | 44,356,200 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
ll ans ;
if(n%2==0) ans = n / 2 -1;
else ans = (n-1) /2;
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<vector<int>> A(3, vector<int>(3));
vector<vector<bool>> bingo(3, vector<bool>(3, false));
for(int i=0; i<3; i++){
for(int j=0; j<3; j++){
cin>> A[i][j];
}
}
int N;
cin>> N;
vector<int> b(N);
for(i... | 0 | 5,917,011 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
in... | #include<iostream>
#include <vector>
using namespace std;
#define ll long long
const ll MOD = 1e9+7;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
for(ll i = 0; i < n; i++){
cin >> a[i];
}
ll ans = 0;
for(ll i = 0; i < 61; i++){
ll x = 0, y = 0;
for(ll j = 0; j < n; j+... | 0 | 40,347,192 |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
string s,t;
cin>>s>>t;
int l1=s.length();
int l2=t.length();
int count=0;
for(int i=0;i<s.length();i++)
{
if(s[i]!=t[i])
count++;
}
cout<<count;
return;
}
int main()
{
solve();
} | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n... | 0 | 31,311,170 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#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++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_... | 0 | 70,400,651 |
# include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bou... | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 0 | 5,226,778 |
#include <iostream>
#define _USE_MATH_DEFINES
#include <cmath>
using namespace std;
int main() {
double a, b, c, C, S, L, h;
cin >> a >> b >> C;
h = b * sin(C * M_PI / 180.0);
S = 0.5 * a * h;
c = sqrt(a * a + b * b - 2 * a * b * cos(C * M_PI / 180.0));
L = a + b + c;
cout << fixed;
cout... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,k,x;
cin>>n>>k;
map<int,int>mp;
for(int i=0; i<n; i++)
{
int x;
cin>>x;
mp[x]++;
}
if(mp.size()<=k)
cout<<0<<endl;
else
{
int m=mp.size();
vector<int>... | 0 | 806,764 |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
bool isinclde(string S, char c);
int main(){
string S;
cin >> S;
string alphabets = "abcdefghijklmnopqrstuvwxyz";
sort(S.begin(), S.end());
int i=0;
while(i<alphabets.size()){
char target = alphabets[i];... | #include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | 0 | 81,289,019 |
#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>
#define mod 1000000007
using namespace std;
typedef long long int lli;
typedef long long ll;
const int MAX = 1000000;
long long fac[MAX],finv[MAX],inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < MAX; i++)
{
fac[i]... | 0 | 62,533,769 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
using namespace std;
int main(){
int n,a;
string s;
cin>>n>>s;
a=s.size();
if(a<=n){
cout<<s<<endl;
}
else{
s[n]='.';
s[n+1]='.';
s[n+2]='.';
for(int i=0;i<n+3;i+... | 0 | 89,267,576 |
#include<iostream>
#include<string.h>
int main()
{
char str[21];
std::cin >> str;
const int length = strlen(str);
for(int i = length - 1; i >= 0; i--)
{
std::cout << str[i];
}
std::cout << std::endl;
return 0;
} | #include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
#define pii pair<int,int>
#define pll pair<long long,long long>
#define usi unordered_set<int>
#define usl unordered_set<long long>
#define umii unordered... | 0 | 20,976,064 |
#include<stdio.h>
#include <string.h>
int main(){
char kata[101];
int angka;
scanf("%d", &angka);
scanf("%s", &kata);
int panjangKata = strlen(kata);
if(panjangKata>angka){
kata[angka] = '\0';
for(int i=0; kata[i] != '\0'; i++){
printf("%c", kata[i]);
}
printf("...");
}
else {
printf("%s", kata);
... | #include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | 0 | 31,862,209 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(... | #include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define int long long
#define pb push_back
#define ff first
#define INF INT_MAX
#define ss second
#define fr(i, j, a) for (int i = j; i < a; i++)
#define cnt_ones(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define sz size()... | 0 | 52,353,652 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long U... | #include <cstdio>
#define NIL -1
struct Node {
int parent, left, right;
};
int *D;
Node *T;
void print(int u) {
printf("node %d: parent = %d, depth = %d, ", u, T[u].parent, D[u]);
if (T[u].parent == NIL) { printf("root, "); }
else if (T[u].left != NIL) { printf("internal node, "); }
else { printf("l... | 0 | 28,942,742 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char * argv[]) {
int a,b,c,d;
double e;
cin >> a >> b;
c = a/b;
d =a%b;
e= 1.0*a/b;
printf("%d %d %.8lf\n",c,d,e);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 15,749,005 |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i=s; i<e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
int P[100];
int main() {
int N, M;
cin >> N >> M;
vector<vector<ll>> S(N);
loop(0, M, i) {
ll k;
cin >> k;
loop(0, k, j) {
ll s;
cin >> s;... | #include <bits/stdc++.h>
using namespace std;
int main(){
long a, b, k;
cin >> a >> b >> k;
for (int i = 0; i < k; i++) {
if (i % 2 == 0) {
if (a % 2 != 0) {
a--;
}
b += a/2;
a /= 2;
} else {
if (b % 2 != 0) {
... | 0 | 30,001,820 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <u... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
int n,k;
cin>>n>>k;
vector<int>a(n);
int mx=0;
rep(i,n)cin>>a[i],mx=max(mx,a[i]);
if(n==1){
if(k==a[0])cout<<"POSSIBLE"<<endl;
else cout<<"IMPOSSIBLE"<<endl;
... | 0 | 98,519,686 |
#include <bits/stdc++.h>
using namespace std;
const long long Mod = 1000000007;
int n;
string str;
int a[200005], xd[200005];
long long p[200005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
p[0] = 1;
for (int i = 1; i <= n; i++)
{
p[i] = (p[i -... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string mes[] = {
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
int main() {
int n;
cin >> n;
while(n--) {
string s;
cin >> s;
int N = s.size();
int pos = -1;
int stock = -1;
... | 0 | 88,591,539 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include <bits/stdc++.h>
#define debug(s) cout << s << endl
#define debug1(s, t) cout << s << " " << t << endl
#define debug2(s, t, u) cout << s << " " << t << " " << u << endl
#define printvec(v) \
for (auto &&i : v) \
cout << i << " "; \
cout << endl
#define rep(n, i) for (int i = 0; i < n; i... | 0 | 60,376,548 |
#include <bits/stdc++.h>
#define FOR(i, c) for (int i = 0; i < c; i++)
#define MOD 1000000007
using namespace std;
int main() {
double l;
cin >> l;
l /= 3;
printf("%.12f\n", l*l*l);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s, t;
cin >> s >> t;
int length = s.length();
int l = t.length();
int ans=0;
int mini = 10000;
for (int i = 0; i <= length-l; ++i){
for (int j = 0; j < l; ++j){
if(s[j+i] != t[j]){
++ans;... | 0 | 68,749,384 |
#include <iostream>
#include <string>
#define IDX(c) ( c - 'a' )
using namespace std;
int main ( void )
{
bool key[26] = { 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1 };
string str;
while ( cin >> str, str != "#" ) {
int cnt = 0,
prev = key[IDX( str[0] )];
for ( int i = 0; i <... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<int> H(n);
int ans = 0;
rep(i,n) cin >> H[i];
rep(i,n-1) {
if (H[i] < H[i+1]... | 0 | 51,065,227 |
#include<bits/stdc++.h>
using namespace std;
#define fi(a) scanf("%d",&a);
#define fli(a) scanf("%ld",&a);
#define fll(a) scanf("%lld",&a);
#define pi(a) printf("%d\n",a);
#define ppi(i,a) printf("Case %d: %d\n",i,a);
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 82,254,240 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.