code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<stdio.h>
int main(){
int W,H,x,y,r;
scanf("%d %d %d %d %d",&W, &H, &x, &y, &r);
if (W >= x + r){
if (x >= r){
if (H >= y + r){
if (y >= r)
printf("Yes\n");
else
printf("No\n");
}
else
printf("No\n");
}
else
printf("No\n");
}
else
printf("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
#define Sort(x) sort(all(x))
#define A first
#define B second
#define sep ' '
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);c... | 0 | 32,809,786 |
#include<iostream>
using namespace std;
int a,b,c;
int main(){
cin>>a>>b>>c;
while(a==b && b==c){
cout<<"1"<<endl;
break;
}
while((a==b&&b!=c)||(b==c&&c!=a)||(c==a&&a!=b)){
cout<<"2"<<endl;
break;
}
while(a!=b && b!=c&&c!=a){
cout<<"3"<<endl;
break;
}
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 59,932,898 |
#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 i, j, k, N, A, B, x, y, count=0, ans=0, sum;
cin >> A >> B;
for(i=A;i<B+1;i++){
x=i;
y=0;
rep(j,5){
y+=(x%10)*pow(10,4-j);
x/=10;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int N;
string S[310];
string SS[310];
bool check(int A) {
rep(i, N) {
rep(j, N) {
int ni = (i + A) % N;
... | 0 | 79,753,812 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(),(x).end()
#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 rep2(i, s, n) for (ll i... | #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... | 0 | 29,989,672 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 18,977,560 |
#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
#include <iomanip>
using namespace std;
#define vsort(v) sort(v.begin(), v.end())
#define vsort_r(v) sort(... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n,len,x=0;
int nA=0,nB=0,nAB=0;
cin>>n;
while(n--)
{
string arr;
cin>>arr;
len=arr.size();
for(int i=0;i<len-1;i++)
{
if(arr[i]=='A'&&arr[i+1]=='B')
nAB++;
}
if(arr[0]=='B')
nB++;
if(arr[len-1]=='A')
nA++;
if(a... | 0 | 78,373,727 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
if(X == Y) cout << -1 << endl;
else {
for(long long i = 1; i <= Y; i++) {
if((X*i) % Y != 0) {
cout << X*i << endl;
break;
}
if(i == Y) cout << -1 << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(a) int((a).size())
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
... | 0 | 99,689,037 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,d;
cin>>n>>d;
int x[n][d];
int cnt=0;
rep(i,n)rep(j,d)cin>>x[i][j];
int ians=0;
double fans=0;
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
for(int k=0;k<d;k++){
ians+=(x[i][k]-x[j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> a(n);
vector<ll> num(n + 1, 0);
for (ll i = 0; i < n; i++) {
cin >> a[i];
num[a[i]]++;
}
ll sum = 0;
for (ll i = 0; i <= n; i++) {
if (2 <= num[i]) {
sum += num[i] * (num[i] - 1) / 2;
}
}
for ... | 0 | 87,029,505 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define y... | #include <bits/stdc++.h>
using namespace std;
long long N, K;
string S;
long long pow(long long N, long long K) {
long long res = 1;
for (int i = 0; i < K; i++)
{
res *= N;
}
return res;
}
long long com(long long N, long long R) {
if(N < R || R < 0) return 0;
if(R == 1) return N;
... | 0 | 78,861,667 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string B[N];
for(int i=0;i<N;i++) cin>>B[i];
int M;
cin>>M;
string R[M];
for(int i=0;i<M;i++) cin>>R[i];
int A=0;
for(int i=0;i<N;i++){
int sum=0;
for(int j=i;j<N;j++){
if(B[i]==B[j]) sum++;
}
for(int k=0;... | #include <iostream>
using namespace std;
int main(){
int H,W;
for (;;){
cin >> H >> W;
if (H == 0&&W == 0)break;
for (int a = 1;a <= W;a++){
if (W == 0||H == 0)break;
cout << "#";
}
cout << endl;
for (int b = 1;b <= H - 2;b++){
if (W == 0 || H == 0)break;
cout <<... | 0 | 53,223,793 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double current_rate, next_rate;
cin >> current_rate >> next_rate;
double performance = 2 * next_rate - current_rate;
cout << performance << endl;
} | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 42,421,089 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
string s, p, ans = "No";
int init;
cin >> s >> p;
init = s.length();
s.append(s);
for(int i=0; i<init; i++){
bool flag = true;
for(int j=0; j<p.length(); j++){
if(p[j] != s[j+i]){
flag = false;
break;
}
}
if... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll N=1e6+5,inf=1e18,mod=1e9+7;
#define test ll testcases;cin>>testcases; while(testcases--)
#define lp(var,start,end) for (ll var = start; var <end ; ++var)
#define rlp(var,start,end) for(ll var = start; var>=end ; var--)
#... | 0 | 99,703,126 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,d,a;
cin>>n>>d>>a;
vector<pair<ll,ll>>ch;
for(ll i=0;i<n;i++){
ll x,y;
cin>>x>>y;
ch.push_back(make_pair(x,y));
}
sort(ch.begin(),ch.end());
queue<pair<ll,ll>>q;
ll ans=0;
ll d... | #include <bits/stdc++.h>
using namespace std;
#define ALL(c) (c).begin(), (c).end()
#define CALL(c) (c).cbegin(), (c).cend()
#define RALL(c) (c).rbegin(), (c).rend()
#define CRALL(c) (c).crbegin(), (c).crend()
#define REP(i, n) for (int i = 0; i < static_cast<int>(n); i++)
#define FOR(i, s, n) for (int i = s; i < stati... | 0 | 10,776,291 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll num = N/K;
ll rem = N%K;
ll count = 0;
count += pow(num, 3);
if (K % 2 == 0) {
if (rem >= K/2) num ++;
count += pow(num, 3);
}
cout << count << endl;
return... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
int main(){
int n;
string s;
cin>>n>>s;
int type[2*n];
int cnt=0;
rep(i,2*n){
type[i]=(... | 0 | 505,136 |
#include<iostream>
int main(){
int n,k;
std::cin >> n >> k;
std::cout << n-k+1;
return 0;
} | #include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | 0 | 56,842,286 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
#define drep(i,cc,n) for(int i=cc;i>=n;--i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<... | #include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#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 FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(... | 0 | 20,198,959 |
#include<iostream>
#include<limits.h>
using namespace std;
int n,m;
const int MAX = 50;
const int MAXN = 100000;
const int INF = INT_MAX;
int C[MAX];
int T[MAXN];
void solve()
{
for(int i = 1; i <= m; i++)
for(int j = C[i]; j <= n; j++)
{
T[j] = min(T[j],T[j-C[i]]+1);
}
cout << T[n]<<endl;
}
int main()
{
c... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | 0 | 6,549,811 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define dunk(a) cout << (a) << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
typedef long long ll;
int main() {
int r; cin >> r;
dunk(r * r);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,k,i;
string ans="NG";
cin >> k >> a >> b;
for(i=a; i<=b; i++)
{
if(i%k == 0){
ans = "OK";
break;
}
}
cout << ans << endl;
return 0;
} | 0 | 90,326,134 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
using namespace std;
using LL = long long;
constexpr long long MOD = 1000... | 0 | 32,177,634 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,C;
cin>>N>>A>>B>>C;
vector<int> l(N);
for(int i=0;i<N;i++){
cin>>l[i];
}
vector<int> p((1<<N),167167167);
vector<int> q((1<<N),167167167);
vector<int> r((1<<N),167167167);
for(int i=1;i<(1<<N);i++){
int L=0,X=0;
vector<int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
const int p = 200010;
vector<int> num(p,0);
for (int i = 0; i < n; i++) {
int a; cin >> a;
num[a]++;
}
sort(num.begin(), num.end(), greater<int>());
int ans = 0;
for ... | 0 | 55,457,689 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string str;
cin >> str;
int n;
cin >> n;
for(int i = 0 ; i < n ; i++ ){
string op;
cin >> op;
if(op == "replace") {
int a, b;
string repstr;
cin >> a >> b >> repstr;
auto it = str.begin() + a;
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n,ans=0;
int a[200005],visited[200005];
signed main()
{
cin>>n;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=n;i++) visited[a[i]]++;
for (int i=1;i<=200000;i++) ans=max(ans,visited[i]+visited[i-1]+visited[i+1]);
cout<<ans<<endl;
retur... | 0 | 32,400,040 |
#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, L;
cin >> N >> L;
vector<string> S(N);
rep(i, N) cin >> S[i];
sort(S.begin(), S.end());
rep(i, N) cout << S[i];
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void){
string s, p;
cin >> s >> p;
s = s + s;
if (s.find(p) != string::npos) {
cout << "Yes" << "\n";
}
else {
cout << "No" << "\n";
}
return 0;
} | 0 | 71,739,956 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e2 + 10;
int a[MAXN], b[MAXN];
int n, mx = 0;
template <class T>
inline void _read(T &x)
{
x = 0;
char t = getchar();
while (!isdigit(t) && t != '-') t = getchar();
if (t == '-')
{
_read(x);
x *= -1;
return ;
... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=100005;
int n,a[maxn],b[maxn];
ll ans;
inline int read(){
int res=0,f_f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f_f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') res=(res<<3)+(res<<1)-'0'+ch,ch=getchar();
return ... | 0 | 35,387,249 |
#include <bits/stdc++.h>
int main() {
int m, f, r;
for(;;) {
std::cin >> m >> f >> r;
if( m == -1 && f == -1 && r == -1 ) {
break;
}
if( m == -1 || f == -1 ) {
std::cout << "F" << std::endl;
}
else if( m + f >= 80 ) {
std::cout << "A" << std::endl;
}
else if( 65 <= ... | #include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
typedef long long ll;
typedef pair<int64_t,int64_t> pll;
int dx[]={1,-1,0,0,1,-1,1,-1};
int dy[]={0,0,1,-1,1,-1,-1,1};
#define rep(i,a,b) for (int64_t i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
#define ALL(a) begin(a),end(a)
#define ... | 0 | 69,105,301 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | 0 | 61,712,600 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin() , v.end()
#define REP(i, x, n) for(int i = x; i < n; i++)
int main(){
string s; cin >> s;
if(s[0] == 'Y'
... | #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.... | 0 | 31,847,951 |
#include <iostream>
#include <climits>
using namespace std;
int main(){
int n;
int res[20];
int numres = 0;
while(1){
cin >> n;
if(n==0){
break;
}
int max = INT_MIN;
int min = INT_MAX;
int total = 0;
int read;
for(int i=0; i<n; ... | #include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back... | 0 | 46,886,057 |
#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... | #include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
const long long INF = 1e18;
const int mod = 1e9 + 7;
const double Pi = acos(-1);
void Fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int... | 0 | 41,008,169 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
float x;
x = (a + b) / 2.0 + 0.5;
cout << static_cast<int>(x) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1e9+7;
const ll INF = 1e18;
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
int main() {
cin.tie(0);
ios_base::sync_with_st... | 0 | 33,716,023 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) {
cin >> x;
}
int max = a.at(0);
int ... | 0 | 40,240,815 |
#include <bits/stdc++.h>
int main() {
int m,v,r;
std::queue<std::string> seiseki;
while(1) {
std::cin >> m >> v >> r;
if(m == -1 && v == -1 && r == -1) {
break;
}else if(m + v >= 80 && m != -1 && v != -1) {
seiseki.push("A");
}else if(m + v >= 65 && m + v < 80 && m != -1 && v != -1) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
return v... | 0 | 5,761,116 |
#include <bits/stdc++.h>
using namespace std;
int n,m;
int f[100004],h[100004];
int F(int x){
if(f[x]==x)return x;
int pa=F(f[x]);
h[x]+=h[f[x]],f[x]=pa;
return f[x];
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)f[i]=i;
for(int i=1;i<=m;i++){
int L,R,D;scanf("%d%d%d",&L,&R,&D);
int l=F(L),r=F(R);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> cut={"maerd","remaerd","esare","resare"};
reverse(S.begin(),S.end());
bool all_cut=false;
for(int i=0;;){
if(i==S.size()){
all_cut=true;
break;
}
bool exist_cut=false;
for(int j=0;j<4;j+... | 0 | 41,785,753 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int ar[3];
for(int i=0;i<3;++i) cin>>ar[i];
sort(ar,ar+3,greater<int>());
cout<<ar[0]-ar[2];
return 0... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 56,380,930 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 86,223,260 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool flag = false;
if (isupper(s[1]) || isupper(s[s.size()-1])){cout << "WA" << endl; return 0;}
for (int i = 0; i < s.size(); i++){
if (i == 0 && s[i] != 'A'){cout << "WA" << endl; return 0;}
if (s[i] == '... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
string S,T;
cin >> S >> T;
int N = S.size();
int M = T.size();
vector<string> cand;
for (int i = 0; i <= N - M; i++) {
string str = S;
bool can = true;
for (int j = 0;... | 0 | 58,388,332 |
#include <iostream>
using namespace std;
int hp,n;
int atk[1001];
int cost[1001];
int mem[10001];
int templen=0;
int f(int hp){
if (hp<=0&&hp!=-99999) return 0;
if (mem[hp]>0) return mem[hp];
int minn=99999999+99999999;
for (int i=0;i<n;i++){
if (hp>0){
int x=f(hp-atk[i])+cost[i];
if (x<minn) mi... | #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) ... | 0 | 57,870,897 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string n;
cin >> n;
if(n.find("7")!=string::npos) {
cout << "Yes" <<'\n';
} else {
cout << "No" <<'\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int64_t a,int64_t b){return a/gcd(a, b)*b;}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int64_t a){if(a<=1)return false;for(int64_t i=2;(int64_t)i*i<=a;i++){if(a%i==0)re... | 0 | 3,906,402 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
void read(int &x)
{
int f=1;
x=0;
char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-')
f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-'0';
s=getchar();
}
x*=f;
}
#d... | 0 | 49,095,210 |
#include<bits/stdc++.h>
using namespace std;
int N;
int A[1<<18];
int mv1[1<<18];
int mv2[1<<18];
int ans[1<<18];
void upd(int a, int b)
{
set<pair<int, int> > S;
S.emplace(A[mv1[a]], mv1[a]);
S.emplace(A[mv1[b]], mv1[b]);
S.emplace(A[mv2[a]], mv2[a]);
S.emplace(A[mv2[b]], mv2[b]);
auto it = S.rbegin();
a... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,c,k,t;
cin>>n>>c>>k;
std::deque<long long int> deq;
for (int i=0;i<n;i++) {
cin>>t;
deq.emplace_back(t);
}
sort(deq.begin(),deq.end());
const long long INF=1LL<<60;
long long int limit=INF;
... | 0 | 51,558,616 |
#ifdef __unix__
#include <bits/stdc++.h>
#else
#include <iostream>
#include <algorithm>
#include <math.h>
#include <functional>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <unordered_set>
#include <stack>
#include <bitset>
#endif
#define fastIO ios_base::sync_with_stdio(0), cin.tie(NULL)
... | #include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
const int MAX_N = 1e5 + 5;
set<ll> remain;
map<ll, int> orig;
ll arr [MAX_N];
ll pos [MAX_N];
vector<ll> ans;
ll L;
void try_del (ll cur) {
auto it = remain.find(cur);
if (it == remain... | 0 | 4,410,741 |
#include<bits/stdc++.h>
using namespace std;
#define ikarus_101 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typed... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
struct UnionFind{
int num;
vector<int> rs,ps;
UnionFind(){}
UnionFind(int n):num(n),rs(n... | 0 | 68,530,631 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int a, b, c, d;
cin >> a >> b >> c >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | 0 | 50,134,534 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 1e9 + 7;
int dp[MAXN][3];
int cost[MAXN][3];
int N;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> cost[i][0] >> cost[i][1] >> cost[i][2];
}
dp[0][0] = cost[0][0]... | #include<iostream>
#include<string>
using namespace std;
int main(){
while(1){
string s;
int count=0;
cin >> s;
int judge[10000]={};
for(int i=0;i<s.size();i++){
if((s[i]=='q')||(s[i]=='w')||(s[i]=='e')||(s[i]=='r')||(s[i]=='t')||(s[i]=='a')||(s[i]=='s')||(s[i]=='d')||(s[i]=='f')||(s[i]=='g'... | 0 | 17,534,019 |
#include <stdio.h>
#include <math.h>
double PI;
double deg2rad(double deg){
return (deg/360)*2*PI;
}
int main()
{
int a,b,c;
double cr;
PI=acos(-1);
scanf("%d %d %d",&a,&b,&c);
cr=deg2rad(c);
printf("%f\n",(a*b*sin(cr))/2);
printf("%f\n",a+b+sqrt(a*a+b*b-2*a*b*cos(cr)));
printf("%f\n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<int> A(N);
for(auto &e : A) cin >> e;
vector<int64_t> S(N + 1);
for(int i = 0; i < N; ++i) S[i + 1] = S[i] + A[i];
for(int i = 1; i <= N; ++i) S[i] = (S[i] - i) % K;
map<int, int> ma;
int64_t ans =... | 0 | 49,780,402 |
#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define REP(i, n) for(int i = 0;i < (n);i++)
#define lint long long
const lint mod=1e9+7;
const lint inf=2.19e15+1;
const long double eps=1e-10;
template <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return fals... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
while(1){
int a,b,c,n[300],max,sa,ans;
cin>>a>>b>>c;
if(a==0&&b==0&&c==0)break;
for(int i=0;i<a;i++){
cin>>n[i];
}
for(int i=b-1;i<=c-1;i++){
sa=n[i]-n[i+1];
if(i==b-1)max=sa;
if(max<=sa){
max=... | 0 | 29,481,755 |
#include <iostream>
using namespace std;
#define MIN(X,Y) ((X)<(Y)?(X):(Y))
#define MAX(X,Y) ((X)>(Y)?(X):(Y))
int main(void){
long long a,b,c,d,ans;
cin >> a >> b >> c >> d;
ans = a*c;
ans = MAX(ans, a*d);
ans = MAX(ans, b*c);
ans = MAX(ans, b*d);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 48,635,819 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n+1),b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll ans = 0;
rep(i,n){
ans += min(a[i]+a[i+1],b[i]);
a[i+1] = clamp(a[i]+a[i+1]-b[i],0,a[i+1]... | #include <bits/stdc++.h>
using namespace std;
long mod=1e9+7;
int main() {
int N;
string S;
cin>>N>>S;
N*=2;
string T=S;
if(S[0]=='B') T[0]='L';
else{
cout<<0<<endl;
return 0;
}
for(int i=0;i<N-1;i++){
if(T[i]=='L'){
if(S[i]=='B'&&S[i+1]=='B') T[i+1]='R';
if(S[i]=='B'&&S[i+1]=='W') T[i+1]='L';
if(S[i]... | 0 | 25,478,690 |
#include <stdio.h>
#include<math.h>
using namespace std;
int main(){
int n,maximum,sum;
while(true){
scanf("%d",&n);
if(n == 0)break;
int array[n];
for(int i=0;i<n;i++)scanf("%d",&array[i]);
maximum = -600000000;
for(int k=0;k<n;k++){
sum = 0;
for(int p=k;p<=n-1;p++){
sum += array[p];
maxim... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<ctime>
using namespace std;
typedef long long ll;
const int MAX=1e5+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const int d[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
const string mode[4]={... | 0 | 50,843,291 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
int D,P;
while(1){
cin>>N>>M;
if(N==0 && M==0) break;
int p[11]={};
for(int i=0;i<N;i++){
cin>>D>>P;
p[P]+=D;
}
for(int i=10;i>0;i--){
if(M>=p[i]){
... | 0 | 22,404,807 |
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, t, x;
cin >> n >> t;
vector<ll>v;
for (ll i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll s = t;
ll ans = 0;
for (ll i = 0; i < n - 1; i++) {
ll z = abs(v[i+1]- v[i]);
... | 0 | 25,759,289 |
#include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 1e5 + 5;
vector<int> adj [MAX_N];
int dp [MAX_N];
void dfs (int u, int p) {
for (int nxt : adj[u]) {
if (nxt != p) {
dfs(nxt, u);
dp[u] ^= dp[nxt] + 1;
}
}
}
int main () {
ios::sync_with_stdio(false);
int n;
cin >... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using int64 = int64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, n;
cin >> h >> n;
int mx = h + 10010;
const int INF = (int)1e8;
vector<vector<int>> dp(n + 1, vector<int>(mx, INF));
dp[0][0] ... | 0 | 66,250,964 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main ()
{
int n;
scanf("%d",&n);
LL ans=0;
bool same = true;
int min_b = 1234567890;
for (int i=1;n>=i;i++)
{
int a,b;
scanf("%d %d",&a,&b);
same &= (a==b);
if (a<=b) ans += a;
els... | #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++)
#... | 0 | 52,614,293 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<functional>
using ll = long long;
using namespace std;
const ll INF = 1000000000000000000... | #include <string>
#include <iostream>
using namespace std;
int main()
{
string S;
cin >> S;
if(S != "0")
{
int A = 0;
for(int i = 0; i < S.size(); i++)
{
A += S[i] - 48;
}
cout << A << endl;
main();
}
return 0;
} | 0 | 96,708,674 |
#include<iostream>
using namespace std;
int main(){
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int time1, time2, awake;
time1 = h1 * 60 + m1;
time2 = h2 * 60 + m2;
awake = time2 - time1;
cout << awake - k;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100005],p[100005];
set<ll> s;
int main(){
ll n,ans=0;
cin>>n;
for(ll i=1;i<=n;i++){
cin>>a[i];
p[a[i]]=i;
}
s.insert(0);s.insert(n+1);
for(ll i=n;i>=1;i--){
auto x=s.upper_bound(p[i]);
auto y=... | 0 | 72,035,596 |
#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 a1,a2,a3;cin>>a1>>a2>>a3;
cout << abs(a1-a2)+abs(a2-a3)+abs(a1-a3)-max(max(abs(a1-a2),abs(a1-a3)),abs(a2-a3)) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define el(a) (a).end()-(a).begin()
int main(){... | 0 | 70,674,918 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
typedef pair<long long, long long> P;
int main(){
int N, K;
cin >> N >> K;
vector<long long> x(N), y(N);
for(int i = 0; i < N; i++) cin >> x[i] >> y[i];
long long ans = 5e18;
for(int i = 0; i < N; i++){
for(int... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
int pointT = 0, pointH = 0;
string taro, hanako;
cin >> n;
for( int i = 0; i < n; i++ )
{
cin >> taro >> hanako;
int count = 0;
if( taro.size() > hanako.siz... | 0 | 88,034,964 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define pb push_back
#define ALL(v) v.begin(),v.end()
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 44,279,054 |
#include<bits/stdc++.h>
#include<iomanip>
#define fast {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define N 1000000
#define ar array
#define mod 1000000007
#define ld long double
#define pb push_back
#define f first
#define s second
typedef long long int ll;
using namespace std;
int main(void){
#ifndef ONLINE_J... | #include <iostream>
using namespace std;
int main() {
int H, W;
while(true) {
cin >> H >> W;
if((H == 0) && (W == 0)) {
break;
}
for(int h = 0; h < H; ++h) {
for(int w = 0; w < W; ++w) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | 0 | 75,902,498 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repp(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
struct UF{
vector<int> par, sz;
void init(int n){
par.resize(n);
... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <ctime>
#include <list>
#include <numeric>
#include <u... | 0 | 67,297,291 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int k; cin>>k;
int a,b; cin>>a>>b;
int i;
i=(b/k)*k;
if((a<=i)) {
cout<<"OK"<<endl;
}
else{
cout<<"NG"<<endl;
}
} | 0 | 76,664,291 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
if(a%b==0)
return(b);
else
return(gcd(b,a%b));
}
int main(){
int a,b,k;
cin >> a >> b >> k;
int x=gcd(a,b);
int answer;
int j=0;
for(int i=x;i>0;i--){
if(x%i==0){
answer=i;
j++;
}
if(j==k)
break;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N , M;
cin >> N >> M;
map<int,int> mp;
for(int i = 0; i < M; i++){
ll tmp1,tmp2;
cin >> tmp1 >> tmp2;
mp[tmp1]++;
mp[tmp2]++;
}
for(int i = 1; i <= N; i++){
if(mp[i] % 2 != ... | 0 | 26,928,847 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <cstring>
#define rep(i,n) for(int i=0;i< (n);++i)
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
int ans=0;
ll H[N];
for(int i=0;i!=N;++i){
cin>>H... | 0 | 36,467,699 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> a(n);
for(int i=0;i<n;i++)
cin>>a.at(i);
for(int _=0;_<k;_++){
vector<int> p=a;
vector<int> d(n+1,0);
for(int i=0;i<n;i++){
d.at(max(i-p.at(i),0))++;
d.at(min(i+p.at(i)+1,n))--;
}
a.at(... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
... | 0 | 19,768,605 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
using namespace std;
#define MOD int(1e9 + 7)
int main()
{
long long N, M;
vector<long long> A;
cin >> N >> M;
map<long long, long long... | #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;
cin >> N;
ll Nsum = 0;
rep(i, N + 1) Nsum += i;
vector<ll> A(N + 1);
ll Asum = 0;
rep(i, N) {
cin >> A[i];
Asum += A[i];
}
A[N] = A[0];
if... | 0 | 86,595,339 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
ll EX(ll x,ll n){
if(n == 0) return 1;
else if(n%2 == 1) return EX(x,n-1)*x%mod;
else return EX(x*x%mod,n/2)%mod;
}
vector<bool> prime_flag;
void flag_prime(ll max){
if(max +1 > prime_flag.size()) prime_flag.re... | #include <iostream>
#include <string>
int main()
{
int taro = 0;
int hana = 0;
int n;
std::cin >> n;
for(int i = 0; i < n; i++){
std::string t;
std::string h;
std::cin >> t >> h;
if(t < h){
hana += 3;
}else
if(t > h){
taro += 3;... | 0 | 31,694,447 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_b... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(ll i=ll(x);i<(ll)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<ll,ll>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
bool f(P ... | 0 | 70,180,599 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main() {
int n;
ll m;
while(cin >> n >> m, n||m) {
ll dist[11] = {};
rep(i, n) {
int d, p;
cin >> d >> p;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define pb push_back
#define ull unsigned long long
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define mat vector<vector<ll>>
mat cn(ll n, ll m){return v... | 0 | 76,577,769 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &... | #include<iostream>
#include<cstdlib>
#include<utility>
#include<tuple>
#include<string>
#include<vector>
#include<numeric>
#include<algorithm>
#include<queue>
#include<deque>
#include<bitset>
#include<cmath>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
#define rep(i... | 0 | 66,137,017 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
std::cout << std::fixed << std::setprecision(10);
ll N;
... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int mp[105][105];
int main() {
int w, h, n;
cin >> w >> h >> n;... | 0 | 68,225,685 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
vector<int> v(n),p(n),q(n);
for(int i=0;i<n;i++)cin>>p[i];
for(int i=0;i<n;i++)cin>>q[i];
for(int i=0;i<n;i++)v[i]=i+1;
int a=0,b=0;
int pos=1;
while(a==0||b==0)
{
... | #include <iostream>
#include <cstdio>
using namespace std;
int main() {
int university[4][3][10] = { 0 }, n, a, b, c, d;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c >> d;
university[a - 1][b - 1][c - 1] += d;
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < ... | 0 | 70,289,021 |
#include<bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
bool solve(vint a, int b){
set<int> s, ss;
s.insert(0);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 0 | 34,395,660 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin >> N >> S;
string ans="";
int count=0;
for(int i=0;i<N;i++){
if(S.at(i)=='('){
count++;
ans.push_back('(');
}else if(S.at(i)==')'){
ans.push_back(')');
if(count==0){
ans.insert(ans.begin(),... | 0 | 63,921,227 |
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <stdio.h>
using namespace std;
void spritStr(string str, vector<string>& v)
{
while (str.find(' ') != -1)
{
v.push_back(str.substr(0, str.find(' ')));
str.erase(0, str.find(' ') + 1);
}
v.push_back(str);
}
i... | #include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define ll long long
const ll N = 1e5+10 ;
int w[N],v[N];
int dp[N];
int main(){
int n,k;
cin >> n >> k;
int m = -1;
memset(dp,0x3f,sizeof dp);
dp[0] = 0;
for(int i = 1;i <= k;++i) {cin>>w[i]... | 0 | 34,003,292 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define roop(i, n) for(int i = 0;i < n;i++)
int main(void){
string str;
cin >> str;
int al[26] = {0};
roop(i, str.length()) al[str[i]-'a']++;
roop(i, 26){
if(al[i] == 0){
str += (cha... | #include <bits/stdc++.h>
using namespace std;
void input(vector<int>& rvnSeq)
{
int nSeqSiz;
cin >> nSeqSiz;
rvnSeq.resize(nSeqSiz);
for (int& rnSeq : rvnSeq)
cin >> rnSeq;
}
int calcLower(const vector<int>& cnrvnSeq)
{
int nMaxSeqCnt = 0;
int nBgn = 0;
while (nBgn < cnrvnSeq.size() )
{
int nSeq... | 0 | 65,557,025 |
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::number<boost::multiprecision::cpp_dec_f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
int main()
{
int n; cin >> n;
int a[n]; rep(i,n) cin >> a[i];
bool positive ... | 0 | 48,579,235 |
#include <iostream>
using namespace std;
int memo[50];
int fib(int n)
{
if(n == 0 || n == 1)
memo[n] = 1;
if(memo[n] != 0)
{
return memo[n];
}
else
{
memo[n] = fib(n - 1) + fib(n - 2);
return memo[n];
}
}
int main()
{
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
using namespace std;
int A[1005][1005]={};
int main() {
int j,k;
string a,b;
cin >> a >> b;
for(j=1;j<=a.size();j++) A[j][0] = j;
for(k=1;k<=b.size();k++) A[0][k] = k;
for(j=1;j<=a.size();j++) {
for(k=1;k<=b.size();k++) {
... | 0 | 58,561,021 |
#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 <iostream>
using namespace std;
using LL = long long;
const LL INF = 1L << 29;
int N, M, R;
int r[8];
bool U[8];
LL d[201][201];
LL ans = INF;
void dfs(int count, int prev, LL dist) {
if (count == R) {
ans = min(ans, dist);
return;
}
for (int i = 0; i < R; i++) {
if (!U[i]) ... | 0 | 93,057,486 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#def... | #include<iostream>
#include<vector>
#define lli long long int
#define pb push_back
using namespace std;
int main()
{
lli n;
lli p = (lli)(1e9+7);
cin>>n;
vector<lli>arr(n+1);
for(lli i=1;i<=n;i++) cin>>arr[i];
vector<lli>set(62,0);
vector<lli>unset(62,0);
for(lli i=0;i<62;i++)
{
... | 0 | 14,538,734 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
long minimum = 1000000, maximum = -1000000, sum = 0;
cin >> n;
for (int i = 0; i < n; i++){
long a;
cin >> a;
minimum = min(a, minimum);
maximum = max(a, maximum);
sum += a;
}
cout << minimum << " " << maximum << " " << sum... | #include<bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, n) for(int i = 0;i < (n);++i)
#define RREP(i, n) for(int i = (n)-1; i >= 0; --i)
#define RANGE(i, a, b) for(int i=(a);i<(b);++i)
#define endl '\n'
#define pb push_back
#define eb emplace_back
#define pque priority_qu... | 0 | 61,371,748 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N; cin >> N;
ll a[N], b[N];
rep(i,... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 0 | 79,865,306 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
using ll = long long;
using namespace std;
const long long MOD = 1000000007;
const ll LINF = 1LL ... | #include<iostream>
using namespace std;
int main()
{
int a,b,c,d,e,f;
cin>>a>>b;
cin>>c>>d;
cin>>e>>f;
if(a==c||a==d){
if(a==e||a==f){
cout<<"NO";
}
else{
cout<<"YES";
}
}
else if(b==c||b==d){
if(b==e||b==f){
cout<<"NO";
}
else{
cout<<"YES";
}
}
... | 0 | 50,632,148 |
#include <iostream>
#include <string>
int main()
{
size_t K;
std::string S;
std::cin >> K >> S;
if(S.size() > K) {
S.resize(K+3);
S[K] = '.';
S[K+1] = '.';
S[K+2] = '.';
}
std::cout << S << std::endl;
return 0;
} | using namespace std;
#include <bits/stdc++.h>
#define frr(i, r, l) for(int i = r; i >= l; --i)
#define fr(i, l, r) for(int i = l; i < r; ++i)
#define forit(it, type, var) for(type::iterator it = var.begin(); it != var.end(); it++)
#define ii pair<int, int>
#define iii pair<int, ii>
#define MEMS(a,b) memset(a,b,sizeof(a... | 0 | 29,135,585 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | 0 | 100,126,687 |
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>
#include <queue>
#include <complex>
#include <set>
#include <map>
#includ... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main(void) {
int N, B[3];
cin >> N >> B[0] >> B[1] >> B[2];
vector <int>l(N);
for (int i = 0; i < N; i++) cin >> l[i];
unsigned int total_cost = 3000;
for (unsigned int i = 0; i < pow(4, N); i++) {
ve... | 0 | 60,413,783 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | #include<bits/stdc++.h>
#define ls ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define __ <<" "<<
#define case(z) "Case " << z++ << ": "
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define quit return 0
using namespace std;
void showmyDS(set<int> ds)
{
set<int... | 0 | 67,767,538 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int A, B, m, c = 0;
cin >> A >> B;
for (int n = A; n <= B; n++) {
if (n >= 10000) {
if ((n % 10 == n / 10000) && ((n / 10) % 10 == (n / 1000) % 10)) {
c++;
}
} else if (n >= ... | #include <bits/stdc++.h>
using namespace std;
void solve(int n, int k, vector<int>&a){
int needed = (log(n) + 1.0)/log(1.34);
needed = min(needed, k);
for(int kk = 0; kk < needed; kk++){
vector<int>B(n, 0);
for(int i = 0; i < n; i++){
int l = max(0, i - a[i]);
int r =... | 0 | 74,956,658 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define Ma7moud_7amdy \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define Open_Sesame Open()
#define all(v) ((v).begin()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K; cin >> N >> K;
vector<ll> a(N); for (int i = 0; i < N; i++) cin >> a[i];
vector<ll> cum(N); cum[0] = a[0];
for (int i = 1; i < N; i++) cum[i] = cum[i-1] + a[i];
map<ll, int> pr;
for (int i = 0; i < N; i++)... | 0 | 82,614,036 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
#define all(v) v.begin(), v.end()
int main() {
int d, s, t;
cin >> d >> t >> s;
if (d <= t*s) cout << "Yes\n";
else cout << "No\n";
} | #include <iostream>
using namespace std;
int main() {
int H, W;
while (1) {
cin >> H >> W;
if (H == 0 && W == 0)break;
for (int i = 0; i < H; i++) {
if (i != 0 && i != H - 1) {
for (int j = 0; j < W; j++) {
if (j == W - 1) {
cout << "#" << endl;
}
else if(j == 0){
cout << "#";
... | 0 | 60,702,341 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> v(n);
for (size_t i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
v[l-1]++;
v[r]--;
}
int ans = 0, num = 0;
for (size_t i = 0; i < n; i++)... | 0 | 98,297,747 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
ll Bc = B / C;
ll Bd = B / D;
ll Ac = (A -... | #include<bits/stdc++.h>
using namespace std;
vector<vector<int>>g;
bool mark[1000000];
int mx=0;
void dfs(int i){
mx++;
mark[i]=true;
for(int j=0;j<g[i].size();j++){
if(!mark[g[i][j]])dfs(g[i][j]);
}
}
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int i,j,k,l,m,n,o,p;
while(cin>>m>... | 0 | 23,357,555 |
#include <iostream>
using namespace std;
#define M 10000000
bool prime[M];
int main()
{
int ans, n;
for (int i = 2; i * i < M; i++){
if (prime[i] == false){
for (int j = i; j < M; j += i){
if (!(i == j)) {
prime[j] = true;
}
}
}
}
while (cin >> n){
ans = 0;
for (int i = 2; i <= n; i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string ... | 0 | 31,832,441 |
#include <bits/stdc++.h>
using namespace std;
#define io \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ul;
const ll oo = 1e18;
const ll N = 1e6;
const ll mod = 1e9 + 7;
#define po... | #include<stdio.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<utility>
#include<memory>
#include<cmath>
#include<stack>
#include<tuple>
#include<numeric>
#include<cassert>
#define ALL(g) (g).begin(),(g).end(... | 0 | 18,115,877 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
#define rep(i,N) for(int i=0;i<(int)N;++i)
typedef long long ll;
using namespace s... | #include<iostream>
#include<string>
#define MAX 100005
#define NIL -1
using namespace std;
struct Node {int parent, left, right; };
Node Nodes[MAX];
int node_num;
int Depth[MAX] ;
void set_depth(int num, int depth){
Depth[num] = depth;
if (Nodes[num].right != NIL)
{
set_depth(Nodes[num].right, depth);
}
if ... | 0 | 57,804,355 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>bool chmin(T &a, const T &b... | 0 | 32,987,265 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define bug(x) cerr<<#x<<" "<<x<<endl;
#define T int time; scanf("%d", &time); while(time--)
int main(){
ll n,m;
cin>>n>>m;
ll r=min(n,m);
ll rr=max(n,m);
fo... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define ll long long
#define pii pair<int, int>
#define is insert
#define er erase
using namespace std;
const int MAX_N = 2e5 + 1;
const int INF = 1e9;
int solve();
#define TASK ""
int main()
{
#ifdef DEBUG
fr... | 0 | 4,481,670 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long N,M;cin>>N>>M;
vector<long>A(N);for(long i=0;i<N;i++)cin>>A[i];
unordered_map<long,long>C;
long s=0;
long ans=0;
for(long i=0;i<N;i++){
s=(s+A[i])%M;
ans+=C[s];
C[s]++;if(s==0)ans++;
}
cout<<ans;
} | #include <iostream>
#include <string>
#include<iomanip>
#include <algorithm>
#include <map>
#include <vector>
#include<queue>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include <map>
#include<string.h>
#include<sstream>
#include<stack>
#include<unordered_map>
#include <iostream>
#include <stdio.h... | 0 | 7,660,927 |
#include<bits/stdc++.h>
using namespace std;
int n,a,b;
pair<int,int> ar[1005];
bool f(pair<int,int> p){
return p.first>=a&&p.second>=b;
}
int main(){
cin>>n>>a>>b;
for(int i=1;i<=n;i++){cin>>ar[i].first>>ar[i].second;}
cout<<count_if(ar+1,ar+n+1,f);
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#d... | 0 | 43,053,558 |
#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;
int a;
vector<P> s(n+1);
for (int i = 1; i <= n; i++) {
cin >> a;
s[i].first = a;
s[i].second = i;
}
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 0 | 55,577,276 |
#include <iostream>
#include <set>
using namespace std;
const string YES = "Yes";
const string NO = "No";
int main() {
int N;
cin >> N;
set<string> s;
string W;
char lastc{'\0'};
bool pred{true};
for (int i = 0; i < N; ++i) {
cin >> W;
if(!s.insert(W).second || (lastc && W.front() != lastc)) {
... | #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;
int main()
{... | 0 | 77,952,440 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 72,376,271 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.