code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<iostream>
#include<string>
using namespace std;
int main(){
string str;
cin>>str;
int sum=0;
for(int i=0;i<str.size();++i){
sum+=str[i]-'0';
}
if(sum%9) cout<<"No\n";
else cout<<"Yes\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begi... | 1 | 31,520,325 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define pb push_back
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin>>a>>b;
cout<<((a-b)>0?(a-b):0)<<endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 2000000000;
int main(){
int x, t;
cin >> x >> t;
... | 1 | 83,006,935 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,d,x;
cin>>n>>d>>x;
int ans=0;
rep(i,0,n){
int a;
cin>>a;
ans+=(d-1)/a+1;
}
cout<<ans+x<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n,d,x;
cin >> n >> d >> x;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<int> cho(d +1,0);
int cnt = 0;
rep(i,n){
rep(j,100){
if(j*... | 1 | 10,866,134 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typede... | #include <iostream>
#include <vector>
#include <algorithm>
#include <list>
#include <queue>
using namespace std;
int main() {
int NV, NE;
cin >> NV >> NE;
vector<int> inDeg(NV, 0);
vector<vector<int> > graph(NV);
for (int i = 0; i < NE; i++) {
int s, t;
cin >> s >> t;
graph[s].push_back(t);
inDeg[t]++;
}... | 1 | 27,464,899 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll N,ans=1; cin>>N;
string S; cin>>S;
for(ll i=0; i<N-1; i++){
if (S[i] == S[i+1])
continue;
ans++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n;cin>>n;
string s;cin>>s;
int cnt=1;
rep(i,n-1){
if(s[i]==s[i+1])continue;
cnt++;
}
cout<<cnt<<endl;
} | 1 | 74,901,226 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n+2]={0};
for(int i=1; i<=n; i++) cin>>arr[i];
int localmax = arr[1];
int localmin = arr[0];
long long ret = 0;
for(int i=1; i<=n+1; i++){
if(arr[i-1]==arr[i]) continue;
else if(arr[i]>arr[i-1]) localmax = arr[i];
else{
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >>n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
long long kotae=a[0];
for(int i=1;i<n;i++){
if(a[i]-a[i-1]>0)kotae+=a[i]-a[i-1];
}
cout<<kotae<<endl;
return 0;
} | 1 | 57,426,684 |
#include <iostream>
using namespace std;
int main() {
int num,num2,num3;
std::cin >> num;
std::cin >> num2;
std::cin >> num3;
if(num < num2) {
if(num2 < num3) {
std::cout << "Yes" <<std::endl;
}else {
std::cout << "No" << std::endl;
}
}else {
std::cout << "No" << std::endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <map>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pai... | 1 | 71,564,080 |
#include <iostream>
using namespace std;
using ll = long long;
#define for_(i,a,b) for(int i = (a);i < (b);i++)
#define rfor_(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define rep(i,n) for_(i,0,(n))
#define rrep(i,n) rfor_(i,0,(n))
int H, W;
int main(){
cin.tie(0);
while(cin>>H>>W,H||W) {
rep(i, H) {
rep(j... | #include <iostream>
using namespace std;
int main() {
int h, y;
cin >> h >> y;
while (h != 0 || y != 0) {
for (int i = 0; i < h; i++) {
for (int s = 0; s < y; s++) {
cout << "#";
}
cout << endl;
}
cout << endl;
cin >> h >> y... | 1 | 43,131,016 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
const lint INF=1LL<<61;
int main(){
int n,k,h[301]={};
scanf("%d%d",&n,&k);
rep(i,n) scanf("%d",&h[i+1]);
lint dp[301][301];
rep(i,n-k+1) rep(j,n+1) dp[i][j]=INF;
dp[0][0]=0;
for(int t=1;t<=n;t++){
for(i... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define f0r(a, b) for (long long a = 0; a < (b); a++)
#define f1r(a, b, c) for (long long a = (b); a < (c); a++)
#define f0rd(a, b) for (long long a = (b); a >= 0; a--)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); ... | 1 | 100,168,404 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,vl>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
const ll INF=1LL<<60;
const ll MOD=1000000007;
int main(){
ll N;
cin >> N;
ll M;
cin >> M;
vector<ll> S(... | #include <bits/stdc++.h>
using namespace std;
#define sz(a) int(a.size())
#define ll long long int
#define mod (long long)(1e9+7)
#define endl '\n'
#define ENGZ ios::sync_with_stdio(0);ios_base::sync_with_stdio(0);cin.tie(0) , cout.tie(0) ;
#define pi (acos(-1))
#define F first
#define S second
ll fp(ll n , ll p )
{
... | 1 | 39,410,991 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(n, 0);
REP(i, n) cin >> a[i];
k = min(k, 100);
REP(j, k)
{
vector<int> b(n, 0);
REP(i, n)
{
int l,r;
l = max(0, i - a[i]);
r = min(n ... | 1 | 94,605,615 |
#include<bits/stdc++.h>
using namespace std;
const int N=110;
int n,ans,lenth;
int tree[N],tot[N];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>tree[i];
lenth=max(lenth,tree[i]);
tot[tree[i]]++;
}
if(lenth%2==1)
{
if(tot[lenth/2+1]!=2)
{
cout<<"Impossible";
return 0;
}
for(int i=1;i<lenth... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
void tost... | 1 | 30,232,307 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long x,n,m;
cin >> x;
n=(x-1)*x;
m=n/2;
cout <<m<<endl;
return 0;
} | 1 | 48,861,979 |
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
inline bool query(ll x) {
char buf[10];
printf("? %ll... | #include <bits/stdc++.h>
typedef long long ll;
const ll most = 1e9;
bool query(ll val){
std::cout << "? " << val << std::endl;
char c;
std::cin >> c;
return (c == 'Y');
}
int main(){
ll length = 1;
if(!query(9)){
for(ll i = 10; i <= most; i *= 10){
if(query(i * 10 - 1)){
length = i;
break;
}
}
... | 1 | 34,577,692 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) REP(i, 0, n)
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPE(i, x, n) for (int i = x; i <= n; i++)
#define OP(x) cout << x << endl;
template<typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
templ... | #include<bits/stdc++.h>
#define bye return 0
#define Yes cout << "Yes" << "\n"
#define No cout << "No" << "\n"
#define YES cout << "YES" << "\n"
#define NO cout << "NO" << "\n"
#define endl cout << "\n"
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
vector<int> xa;
vector<int... | 1 | 69,485,711 |
#include<bits/stdc++.h>
using namespace std;
int a[10005]={};
int find(int x){
if(a[x]==x)return a[x];
else return (a[x]=find(a[x]));
}
int main(){
int n,q;cin>>n>>q;
for(int i=0;i<10005;i++)a[i]=i;
for(int i=0;i<q;i++){
int t,x,y;cin>>t>>x>>y;
if(t==0){a[find(x)]=find(y);}
if(t==1){cout<<(find(x)==... | #include <iostream>
#include <limits.h>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair<int,int> P;
const int INF=INT_MAX/3;
const int V_MAX=10000,E_MAX=10000;
const int N=10000;
int V,E;
int par[N];
int rank[N];
int n,q;
void init(){
for(int i=0;i<n;i++){
par[i]=i;
rank[i]=0;
}
}
in... | 1 | 16,419,458 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n,k;
cin>>n>>k;
ll ans=1;
ans*=k;
for(ll i=1;i<n;i++){
ans*=(k-1);
}
cout<<ans<<endl;
} | 1 | 28,867,305 |
#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... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long modpow(long long a, long long b){
long long ans = 1;
while (b > 0){
if (b % 2 == 1){
ans *= a;
ans %= MOD;
}
a *= a;
a %= MOD;
b /= 2;
}
return ans;
}
long long modinv(long long a){
return modpo... | 1 | 52,620,810 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include<bits/stdc++.h>
using namespace std;
long long n,ans;
struct N {
long long size,color,sum;
}a[100009];
bool cmp(N a,N b) {
return a.size<b.size;
}
int main() {
cin>>n;
for (int i=1; i<=n; ++i) {
cin>>a[i].size;
a[i].color=i;
}
sort(a+1,a+n+1,cmp);
for (int i=1; i<=n; ++i) {
a[i].sum=a[i-1].sum+a[i]... | 1 | 26,046,598 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define join(a, d) accumulate(a.begin() + 1, a.end(), a[0], [](string s, s... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<vector<char>> data(h,vector<char>(w));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> data.at(i).at(j);
}
}
vector<int> dx={-1,0,1,0};
vector<int> dy={0,1,0,-1};
bool jd = true;
for(int i=0;i<h;i... | 1 | 74,365,479 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M);
vector<vector<int>> yd(N);
for (int i = 0; i < M; i++) {
cin >> P.at(i) >> Y.at(i);
yd.at(P.at(i) - 1).push_back(Y.at(i));
}
for (int i = 0; i < N; i++) sort(yd.at(i).begin(), yd.at(i).end()... | 1 | 79,796,840 |
#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<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini freopen(name".inp","r",stdin); freopen(name".out","w",stdout)
#define foe(it,c) for (__typeof(c.begin()) it = c.begin(); it != c.end(); it++)
#define long long long
#define db double
#define pii pair <int, int>
#define pll pair <long, long>
#de... | 1 | 43,213,836 |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll h,w;
cin >> h >> w;
vector<string> s(h);
for(ll i=0;i<h;i++) cin >> s[i];
ll f=1;
vec idx={1,0,-1,0};
vec i... | 1 | 92,650,405 |
#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>;
signed main(void)
{
int n;
cin >> n;
vector<ll> sum(n);
map<ll, ll> mp;
ll cnt;
rep(i, n) cin >> sum[i];
rep(i, n - 1) sum[i + 1] += sum[i];
rep(i, n) mp[sum[i]]++;
cnt ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 1 | 50,829,493 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef pair<int, int> p... | 1 | 75,538,453 |
#include <iostream>
using namespace std;
int main() {
double money = 100000;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
money *= 1.05;
double miman = money - ((int)(money*0.001)) * 1000.0;
if (miman > 0) {
money = money - miman + 1000.0;
}
}
cout << (int)money << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int loan = 100000;
for(int i=0; i<n; i++){
loan = loan * 1.05;
if(loan%1000 != 0){
loan = loan/1000;
loan = loan * 1000;
loan = loan + 1000;
}
}
cout <<loan<<endl;
... | 1 | 83,465,128 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge
{
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL <... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i,a,b) for (int i = a; i <= (int)(b); i++)
using namespace std;
const int MOD=1e9+7;
void add( long long &v, long long x ) {
(v+=x)%=MOD;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n,k;
cin ... | 1 | 52,620,459 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
#include <iostream>
#include <vector>
using namespace std;
const int MAX_H = 11000;
int dp[MAX_H];
int main() {
int H,n... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | 1 | 53,360,584 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
deque<char> list;
string str, fin="";
cin >> str;
long long num=str.length(), sze;
char chr;
for (long long i=0; i<num; i++) {
chr=str[i];
sze=list.size();
if (chr... | #include <bits/stdc++.h>
using namespace std;
void solve(){
string s; cin >> s;
string ans;
for(int i = 0; i < s.size(); ++i){
if(s[i] == '0') {ans += '0';}
else if(s[i] == '1') {ans += '1';}
else {if (!ans.empty()) {ans.erase(ans.size()-1, 1);}
}
}
cout << ans << endl;
}... | 1 | 77,967,676 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> ii;
typedef map<int, int> MPII;
typedef set<int> SE... | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
bool B[26]{};
int main() {
string S;
cin >> S;
for (int i = 0; i < S.size(); ++i) {
if (B[S[i] - 'a']) {
printf("no\n");
return 0;
} else {
B[S[i] - 'a'] = true;
}
}
printf("yes\n");
} | 1 | 77,364,577 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
ll a[n];
rep(i, n) {
... | 1 | 93,805,949 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define PPB pop_back
typedef pair<int, int> pii;
static const int INF = 1LL<<61;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string ans1, ans2, in;
int tm = 0;
map<string, int> gedo;
while (cin >> in) {
... | #include<cstdio>
#include<cstring>
int main(){
char word[380][33];
int count[380] = {};
int now = 0;
int max = 0;
int a, b = 0;
char s[33];
while(scanf("%s", &s) + 1){
int t = 0;
while(s[t]){
if('A' <= s[t] && s[t] <= 'Z'){
s[t] = s[t] + 'a' - 'A';
}
t++;
}
bool flug = true;
for(int i = 0;... | 1 | 97,020,093 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int M,K;
cin >> M >> K;
int ub= 1<<M;
if(K>=ub){
cout << -1 << endl;
}
else if(M==1){
if(K==0){
cout << 0 <<" "<< 0 <<" "<< 1 <<" "<< 1 << endl;
}
else{
cout << -1 << endl;
}
}
else{
for(int i=0; i<ub; i++){
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define F first
#define S second
#d... | 1 | 70,302,689 |
#include <iostream>
using namespace std;
int main()
{
int trainCost, busCost, fare;
fare = 0;
cin >> trainCost >> busCost;
fare = trainCost + (busCost / 2);
cout << fare << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
cout << A + B / 2 << endl;
} | 1 | 48,452,980 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
int n;
cin >> n;
vector<int>a(n);
vector<int>b(n);
int i;
for (i = 0; i < n; i++)
{
cin >> a.at(i);
}
for (i = 0; i < n; i++)
{
b.at... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
int n;
cin >> n;
vector<pair<int,int>> a;
... | 1 | 50,970,297 |
#include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)+1):((m)-(n)+1)),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (a.... | #include<iostream>
#include<stack>
using namespace std;
int main(){
int op;
stack<int> intStack;
while(cin>> op){
if(op == 0){
cout << intStack.top() << endl;
intStack.pop();
} else {
intStack.push(op);
}
}
return 0;
} | 1 | 3,895,822 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string n;
bool ans = false;
cin >>... | #include <bits/stdc++.h>
using namespace std;
int main(){
string n;
cin >> n;
bool judge=false;
if(n.at(0)==n.at(1) && n.at(1)==n.at(2)) judge=true;
if(n.at(1)==n.at(2) && n.at(2)==n.at(3)) judge=true;
if(judge) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 85,649,943 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
const do... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vpii=vector<pii>;
#define ... | 1 | 86,251,966 |
#include <iostream>
using namespace std;
int main()
{
int a,b;
cin>>a;
b=1110-a;
cout<<b;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 1 | 5,177,861 |
#include<iostream>
#include<vector>
int main(){
int h,w,m;
std::cin>>h>>w>>m;
std::vector<int> yList(m);
std::vector<int> xList(m);
for(int i=0; i< m; i++)
std::cin>>yList[i]>>xList[i];
std::vector<long long> yCount(h, 0);
std::vector<long long> xCount(w, 0);
for(int i=0; i<m; i++){
yCount[yList[i]-1]++;
... | #include<bits/stdc++.h>
using namespace std;
#define forinc(a,b,c) for(int a=b, __c=c; a<=__c; ++a)
#define fordec(a,b,c) for(int a=b, __c=c; a>=__c; --a)
#define forv(a,b) for(auto &a:b)
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(a) begin(a),end... | 1 | 44,252,493 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <bitset>
#include <deque>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <iterator>
#include <string>
#include <chrono>
#include <random>... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<doub... | 1 | 2,272,358 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define whatis(x) cout << #x << " is " << x<<" ";
#define whatisl(x) cout << #x << " is " << x<<"\n";
#define parr(array,end)for(ll loop=0;loop<end;loop++)cout<<array[loop]<<" ";cout<<"\n";
#define lline cout<<"\n";
#define e... | #include <iostream>
#include <string>
using namespace std;
int main(){
string S;
cin >> S;
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
int len = S.size();
string last;
while(true){
if(len < 5){
cout << "NO" << endl;
return 0;
}
last... | 1 | 71,139,205 |
#include <iostream>
#include <cmath>
#include <cstdint>
int main()
{
int64_t a, b, c, d;
std::cin >> a >> b >> c >> d;
int64_t num[4] = {a * c, a * d, b * c, b * d};
int64_t max = num[0];
for(int i = 1; i < 4; i++)
{
if(num[i] > max)
{
max = num[i];
}
}
std::cout << max << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ans = LLONG_MIN;
ans = max(ans, a*c);
ans = max(ans, a*d);
ans = max(ans, b*c);
ans = max(ans, b*d);
cout << ans << endl;
} | 1 | 53,414,654 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
string s;
cin >> s;
int d; cin >... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 1 | 23,972,508 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout<< (x) << " "
int main(){
int x;cin>>x;
int r=x/100, q=x%100;
if(5*r>=q)co(1);
else co(0);
} | #include <bits/stdc++.h>
using namespace std;
const int64_t INF=9999999999999999;
int main() {
int X;
cin>>X;
for(int i=1;i<=X/100;i++){
if(X>=100*i&&X<=100*i+5*i){cout<<1<<endl;return 0;}
}
cout<<0<<endl;
return 0;} | 1 | 95,940,799 |
#include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
#inc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef std::pair<int,int> pair2;
typedef std::pair<int,pair2> pair3;
const ll INF = 1LL<<60;
const ll NUM=10e8+7;
int main(){
ll N,X,M;
cin>>N>>X>>M;
ll ans=0;
vector<ll> dist(M,-1);
ll count;
count=1;
while(1){
dist[X]=count;
ans=ans+... | 1 | 83,943,493 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n;
c... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
bool ans = false;
for (int i = 0; i <= n / 4; i++) {
if ((n - i * 4) % 7 == 0) {
ans = true;
break;
}
}
if (ans) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
} | 1 | 18,928,126 |
#include <iostream>
#include <stdio.h>
int main() {
int l; std::cin >> l;
printf("%.10lf\n", (l*l*l)/27.0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long double L;
cin >> L;
L /= 3;
cout << fixed << setprecision(6) << L * L * L << "\n";
} | 1 | 63,920,640 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define debug(vec) for(auto v : vec) cout << v << " "; cout << endl;
#define debug2D(vec2D) for(auto vec : vec2D) { for (auto v : vec) cout << v << " "; cout << endl;... | #pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define int long long
string per(int n) {
string s;
if (n == 0) {
s += '0';
return... | 1 | 41,449,053 |
#include <bits/stdc++.h>
#include <ext/rope>
using namespace __gnu_cxx;
using namespace std;
#define mst(a,b) memset(a,b,sizeof(a))
#define ALL(x) x.begin(),x.end()
#define pii pair<int, int>
#define debug(a) cout << #a": " << a << endl;
#define eularMod(a, b) a < b ? a : a % b + b
inline int lowbit(int x){ return x & ... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 1 | 58,156,010 |
#include<bits/stdc++.h>
using namespace std;
#define SC scanf
#define PR printf
#define pb push_back
#define mp make_pair
#define SZ(v) ((int)(v).size())
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define db double
#define ldb long double
#define uint... | #include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
using... | 1 | 14,321,844 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,x;
ll a[55],b[55];
ll dfs(ll N,ll X){
ll count=0;
if(N==0) count=1;
else if(X==1) count+=0;
else if(X>=2&&X<=a[N-1]+1){
count+=dfs(N-1,X-1);
}
else if(X==a[N-1]+2){
count+=b[N-1]+1;
}
else if(X>=a[N-... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | 1 | 66,391,469 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
int a, b;
cin >> a >> b;
if ((a + b) % 3 == 0 || a % 3 == 0 || b % 3 == 0)
cout << "Possible";
else
{
cout << "Impossible";
}
} | 1 | 84,526,323 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
long long fac[1000010], finv[1000010], inv[1000010];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7, N = 2e6 + 1;
int x, y, f[N], inv[N];
int binpow(int a, int b){
int res = 1;
while(b){
if(b & 1) (res *= a) %= mod, --b;
else (a *= a) %= mod, b >>= 1;
}
return res;
}
int inverse(int x){
return binpow(x, mod - 2);
}
vo... | 1 | 10,230,047 |
#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 namespace std;
typedef long long ll;
void solve(long long N, long long K, std::vector<long long> A){
ll ans = 0;
ll right = 0;
while(true){
if(right == 0) right += K;
else right += K - 1;
ans ++;
if(right >= N) break;
}
cout << ans << en... | 1 | 64,021,475 |
#include<iostream>
#include<vector>
#include<set>
using namespace std;
int main(){
string s = "abcdefghijklmnopqrstuvwxyz";
string str;
cin >> str;
set<char> st;
for(int i=0;i<s.size();i++){
st.insert(s[i]);
}
for(int i=0;i<str.size();i++){
st.erase(str[i]);
}
if(st.siz... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (char c='a'; c<='z'; c++) {
if (s.find(c) == string::npos) {
cout << c << endl;
return 0;
}
}
cout << "None" << endl;
} | 1 | 45,740,465 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define INF 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool ... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
using namespace std;
int main() {
cout<<fixed<<showpoint;
cout<<setprecision(9);
long double x;
string s;
int n;
cin>>n;
long double sum = 0;
while(n--)
{
cin>>x>>s;
if(s == "BTC")
{
sum+=(x*380000.0);
}
else
{
sum... | 1 | 31,609,040 |
#include<bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int total_path(char c[1002][1002],int n,int m) {
int dp[n][m];
int f=0;
for(int i=n-1;i>=0;i--) {
if(c[i][m-1] == '.' && f == 0) {
dp[i][m-1] = 1;
}
else {
dp[i][m-1] = 0;
f = 1;
}
}
f=0;
for(int i=m-2;i>... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
#define mmm ios_base::sync_with_stdio(false);cin.tie(NULL);
const int MOD = 1e9 + 7;
int dp[1000][1000];
string s[1000];
int main()
{
mmm;
int n,m; cin>>n>>m;
for(int i=0; i<n; i++)
cin>>s[i];
dp[0][0]=1;
... | 1 | 68,787,517 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <numeric>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 1 | 88,546,103 |
#include<iostream>
using namespace std;
#include<vector>
int main() {
int n, m, res = 0;
cin >> n >> m;
int lb[m][n], p[m], k[m];
for(int i = 0; i < m; i++) {
cin >> k[i];
for(int j = 1; j <= k[i]; j++) {
cin >> lb[i][j];
}
}
for(int i = 0; i < m; i++) {
cin >> p[i];
}
bool flag;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
vector<vector<int> > s(m, vector<int>());
vector<int> p(m);
rep(i, m){
int k;
cin >> k;
rep(j, k){
int sw;
ci... | 1 | 5,313,355 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X;
cin >> X;
if(X/100 >= (X%100 + 4) / 5)
cout << 1 << endl;
else
cout << 0 << endl;
} | #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() {
int x;
cin >> x;
int n = x / 100;
int need = x % 100;
int ans = 0;
if (need <= 5 * n) {
cout << 1 << endl;
... | 1 | 9,361,238 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int r;
cin>>r;
if(r/100==7||r%100/10==7||r%100%10==7)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | #include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | 1 | 15,017,346 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<numeric>
#include<math.h>
using namespace std;
typedef long long ll;
ll MOD = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
int q... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int x, y, z;
x = y = z = 0;
for (int i = 0; i < N; i++) {
int p;
cin >> p;
if (p <= A) {
x++;
} else if (p <= B) {
y++;
} else {
z++;
}
}
int ans;
ans = min(x, min(... | 1 | 61,366,081 |
#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>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 1 | 40,340,938 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
string s, t; cin >> s >> t;
sort(all(s));
sort(all(t));
reverse(all(t));
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 1 | 5,645,625 |
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, m; cin >> n >> m;
vector<vector<int>> s(m);
for(int i = 0; i < m; i++) {
int k; cin >> k;
s[i].resize(k);
for(int j = 0; j < k; j++) {
cin >> s[i][j]; s[i][j]--;
}
}
vector<int> p(m);
for(int ... | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
int N, M; cin >> N >> M;
vector<vector<int>> lights(M);
rep(i, M){
int k; cin >>... | 1 | 20,960,781 |
#include<iostream>
using namespace std;
bool countdiv8(int i) {
int j,count=0;
for(j=1; j<=i; j++) {
if(i%j==0) {
count++;
}
}
if(count == 8) return true;
else return false;
}
int main() {
int i,N,count=0;
cin >> N;
for(i=1;i<=N;i+=2) {
if(countdiv8(i)) count++;
}
cout << count << ... | #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> div(n+1);
int ans = 0;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
if (i % j == 0) div[i]++;
}
}
for(int... | 1 | 20,491,709 |
#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main(void){
int a,b; ... | #include <cstdio>
#include <cmath>
int main(){
int a,b,C;
scanf("%d %d %d",&a,&b,&C);
double r=C*M_PI/180;
double S,L,h;
S=a*b*sin(r)/2;
L=sqrt(a*a+b*b-2*a*b*cos(r))+b+a;
h=b*sin(r);
printf("%.8f %.8f %.8f\n",S,L,h);
return 0;
} | 1 | 12,406,082 |
#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(){
string s,t;
cin>>s>>t;
bool flag=true;
rep(i,s.size()){
if(s[i]!=t[i])flag=false;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int,int> ,null_type,less<pair<int,int>>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
typedef long long ll;
const int N = 2e5+10 , OO = 0x3f3f3f3f , mod = 1e9 + 7;
#define ... | 1 | 86,163,290 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const ld pi = 3... | #include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | 1 | 81,333,919 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int r, d, x;
cin >> r >> d >> x;
for (int i = 0; i < 10; i++) {
x = r * x - d;
cout << x << endl;
}
return 0;
} | #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... | 1 | 51,437,239 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
using namespace std;
using ll=int64_t;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int main(){
int k,s;
cin>>k>>s;
int ans=... | #include<bits/stdc++.h>
using namespace std;
#define Bye return 0
#define ll long long
void solve(){
int k, s; cin>>k>>s;
int cont = 0;
for (int x=0; x<=k; x++)
for (int y=0; y<=k; y++){
int z = s - x - y;
cont += (z>=0 && z<=k);
}
cout<<cont<<endl;
}
int main(){
... | 1 | 86,858,053 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
int main(){
int n;
cin >> n;
vector<int... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
using namespace std;
#define INF 2000001145
#define L... | 1 | 100,731,175 |
#include <bits/stdc++.h>
using namespace std;
static const int INFH = (1<<30)-1;
static const int INFL = -INFH;
vector<pair<char, int>> runLength(string x)
{
char now = x[0];
int count = 1;
vector<pair<char, int>> ret;
for (int i = 1; i < x.size(); ++i)
{
if(x[i] != now)
{
ret.push_back(make_pair(now, count... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >>s;
long long ret = 0;
vector<long long> v(s.size()+1);
for (int i = 0; i <= s.size(); i++) {v[i]=0;}
for (int i = 0; i <= s.size(); i++) {if(s[i]=='<'){v[i+1]=max(v[i+1],v[i]+1);}}
for (int i = s.size(); i >= 0; i--) {if(... | 1 | 82,909,477 |
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <iterator>
using namespace std;
#define RESIDUE(u,v) (capacity[u][v] - flow[u][v])
#define RCOST(u,v) (cost[u][v] + h[u] - h[v])
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define DSIZE 1024*1024*64
int... | #include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=300010;
int ans=0,tot=0,sum[maxn],a[maxn],f[maxn],g[1<<26],n,l,r;
char s[maxn];
void read(int &k){
k=0; int f=1; char c=getchar();
while (c<'0'||c>'9')c=='-'&&(f=-1),c=getchar();
while ('0'<=c&&c<='9')k=k*10+c-'0',c=g... | 1 | 28,399,839 |
#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<iostream>
#include<vector>
#include<string>
const int ALPHABET = 'z' - 'a' + 1;
int main(){
int n;
std::cin >> n;
std::vector<std::vector<int>> alphabet(n, std::vector<int>(ALPHABET, 0));
for(int i = 0; i < n; i++){
std::string S;
std::cin >> S;
for(int j = 0; j < S.size... | 1 | 85,027,326 |
#include <iostream>
using namespace std;
int main()
{
int i;
char str[30];
cin >> str;
for(i=0; str[i] != 0; i++);
i--;
for(;i>=0; i--){
cout << str[i];
}
cout << endl;
return(0);
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()
#define PI 3.14159265358479... | 1 | 23,999,063 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int arr[101] = {0};
int main()
{
int a, total2=9999999;
cin >> a;
for(int i=0; i<a; i++)
{
cin >> arr[i];
}
for(int i=0; i<=100; i++)
{
int total=0;
for(int j=0; j<a; j++)
... | #include <bits/stdc++.h>
#define int long long
#define fast_io(); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define loop(i,a,b) for(int i=a;i<b;i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define ins insert
#define fi first
#define se second
#define _max max_element
#define _min min_element
... | 1 | 82,734,053 |
#include<iostream>
int main(){
int n,d,num;
std::cin>>n;
int flag,B[100][100]={0};
for(int i=0;i<n;i++){
std::cin>>num>>d;
for(int j=0;j<d;j++){
std::cin>>flag;
B[num-1][flag-1]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(j!=n-1){
std::cout<<B[i][j]<<" ";
}... | #include<iostream>
using namespace std;
int main(){
int n,u,m,c;
int b[1000][1000] = {};
int a[1000][1000] = {};
cin >> n;
for(int i = 1;i <=n ;i++){
cin >> u >> m;
for(int j = 1;j <= m;j++){
cin >> b[u][j];
}
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
if(b[i][j] !... | 1 | 6,890,251 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
string s; cin>>s;
int n=s.length();
lint hist[128]={};
rep(i,n) hist[s[i]]++;
lint ans=1;
for(int c='a';c<='z';c++) for(int d=c+1;d<='z';d++) {
ans+=hist[c]*hist[d];
}
cout<<ans<<'\n';
retu... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | 1 | 54,671,500 |
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace... | #include <cstdio>
#include <cstdint>
#include <algorithm>
int main() {
intmax_t X, Y;
scanf("%jd %jd", &X, &Y);
if (X < Y)
std::swap(X, Y);
printf("%s\n", (X-Y>1)? "Alice":"Brown");
} | 1 | 13,256,916 |
#include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define lli long long int
#define rep(i,n) for(lli i=0; i<n; i++)
#define loop(i, j, n) for(lli i=j; i<n; i++)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
con... | #include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <vector>
#define ll long long
int main()
{
int N, R;
std::cin >> N >> R;
if(N >= 10) {
std::cout << R << std::endl;
}
else {
std::cout << R + (10-N)*100 << std::endl;
}
} | 1 | 94,260,393 |
#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);
rep(i,n) cin >> a[i];
vector<int> ans(n);
rep(i,n){
ans[a[i]-1] = i + 1;
}
rep(i,n) cout << ans[i] << endl;
} | #include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
int main() {
int N; cin>>N;
vi ans(N);
for (int i = 0; i < N; i++){
int a; cin>>a;
ans[a-1]=i+1;
}
for(int x : ans)cout<<x<<" ";
cout<<endl;
} | 1 | 31,402,012 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using P = pair<ll,ll>;
using um = unordered_map<ll,ll>;
#define fl cout<<flush;
#define endl '\n'
template <typename T> inline void prt(T v){cout<<... | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
vector<int> in(3);
rep(i, 3) cin >> in[i];
sort(in.begin(), in.end());
cout << in[2] - in[0] << endl;
return 0;
} | 1 | 38,034,033 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main(){
int n,k; cin >>n >>k;
double prototal = 0;
for(int i = 1; i<=n; i++){
double pro = 1.0/n;
int sum = i;
while(sum<k){
pro /= 2;
sum *= 2;
}
prototal += pro;
}... | #include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define forn(i,a,b) for(int i=a;i<=b;i++)
#define ft first
#define sd second
#define sz size()
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).b... | 1 | 42,955,473 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int,string>;
int main() {
int a,b;
cin >> a >> b;
string s;
cin >> s;
bool ans = true;
rep(i,s.size()){
if(i != a && s.at(i) == '-') ans = false;
else if(i == a && s.at(i)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,sum=0;
cin >> A >> B;
string S;
cin >> S;
if(S[A]=='-'){
sum++;
for(int i=0;i<A;i++){
if(S[i]!='-'){
sum++;
}
}
for(int i=A+1;i<A+B+1;i++){
if(S[i]!='-'){
sum++;
}
}
}
if(sum==A+B+1... | 1 | 85,624,648 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
scanf("%d %d", &x, &y);
if(y - x >= 0)
printf("%d\n", min(y - x, abs(x + y) + 1));
else
printf("%d\n", min(x - y + 2, abs(x + y) + 1));
} | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
void go(int x) {
cout << x << endl;
exit(0);
}
void solve() {
int x, y;
cin >> x >> y;
if(x == 0 || y == 0) {
if(x == 0) {
if(y >= 0) go(y - x);
else go(abs(y) + 1);
} else if(y == 0) {
if(x < 0) go... | 1 | 73,996,760 |
#include <bits/stdc++.h>
using namespace std;
#define vit vector<int>::iterator
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fr first
#define sc second
#define skip continue
#define PI 3.14159265
typedef u... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int K, S;
cin >> K >> S;
int ans = 0;
for(int X = 0; X <= K; X++){
for(int Y = 0; Y <= K; Y++){
int Z = S - X - Y;
if(0<=Z && Z <= K) ans++;
}
}
co... | 1 | 2,486,165 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
const int INT_INF = 1001001001;
const double PI = acos(-1.0);
int main(){
int n;
ll k;
cin >> n >> k;
map<int,ll> m;
for(int i=0;i<n;i++){
int a,b;
cin >> a ... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define ... | 1 | 9,044,332 |
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int key;
Node *next, *prev;
};
Node *nil;
Node* listSearch(int key)
{
Node *cur = nil->next;
while (cur != nil && cur->key != key )
{
cur = cur->next;
}
return cur;
}
void init()
{
nil = (Node *)malloc(sizeof(Node));
... | # include <cstdio>
# include <cstring>
# include <cstdlib>
struct Node {
int key;
Node *prev, *next;
};
Node *nil;
void init() {
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void insert(int key) {
Node *x = (Node *)malloc(sizeof(Node));
x->key = key;
x->next = nil->next;
nil->nex... | 1 | 41,800,653 |
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,x,tot,cnt,sum;
int a[N],b[N],c[N];
int main(){
scanf("%d",&n);
for (register int i=1; i<=n; ++i)
{
scanf("%d",&x);
if (i&1) a[++tot]=x;
else b[++cnt]=x;
c[i]=x;
}
sort(a+1,a+tot+1); sort(b+1,b+cnt+1);
sort(c+1,c+n+1);
for (register ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
ll N;
vector<ll> A, B;
int main(int argc, char **argv)
{
cin >> N;
... | 1 | 87,637,568 |
#include <stdio.h>
#include <iostream>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string.h>
#include <limits.h>
#include <map>
#include <string>
#include <bitset>
#include <vector>
using namespace std;
int main() {
long long ans=0;
long... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
const int MOD = 1e9+7;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,k,a=0;
cin>>n>>k;
for (int i=k; i<=n+1; ++i){
a += (n-i+1)*i + 1;
a%=MOD;
}
cout<<a;
return 0;
} | 1 | 85,950,278 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pi... | #define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) ... | 1 | 67,984,919 |
#include <stdio.h>
#include <iostream>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
int n;
int main() {
int a, b, c, d;
while(scanf("%d\n", &n) != EOF) {
int count = 0;
rep(a,10) {
rep(b,10) {
rep(c,10) {
rep(d,10) {
if(a + b + c + d == n) count++;
}
}
}
}
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, res;
while (cin >> n) {
res = 0;
for (int a = 0; a < 10; a++) {
for (int b = 0; b < 10; b++) {
for (int c = 0; c < 10; c++) {
for (int d = 0; d < 10; d++) {
if (a + b + c + d == n) {
res++;
}
... | 1 | 17,634,420 |
#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;
ll ans;
ans=K;
for(int i=2; i<=N; i++){
ans *= K-1;
}
cout << ans << endl;
} | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
ll a[100005];
int main() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << k << endl;
return 0;
}
ll ans = k;
int i = 1;
while (i != n ) {
i++;
ans *= (k - 1);
}... | 1 | 76,913,125 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const long long INF = 1001001001;
const long long MOD = 1000000007;
const double EPS = 1e-10;
ll GCD(ll a,ll b){
return b?GCD(b,a%b):a;
}
ll LCM(ll a,ll b){
if(a==0)return b;
if(b==0)return a;
return a/GCD(a,b)... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
ll gcd(ll a,... | 1 | 21,523,426 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, b;
cin >... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int cnt[100010];
int main()
... | 1 | 63,868,250 |
#include <numeric>
#include <iostream>
#include <array>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
#include <utility>
#include <deque>
#include <queue>
using namespace std;
#define ll long long int
#define rep(i, n) for(ll i = 0; i < n; i... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = 1e18, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;
priority_queue<Pa> que;
int ... | 1 | 77,290,454 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FASTIO ios_base::sync_with_stdio(0);cin.t... | #include <bits/stdc++.h>
using namespace std;
int FindRainyDays(string& S) {
int max_length = 0;
int count = 0;
for (int i = 0; i < S.length(); ++i) {
if (S[i] == 'R') {
count++;
}
else {
max_length = max(max_length, count);
count = 0;
}
}
max_length = max(max_length, count);... | 1 | 17,649,091 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
const double pi = acos(-1);
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/range/adaptor/reversed.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long int ll;
#define PI (acos(-1))
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define dump(x)... | 1 | 64,900,596 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.