code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
ll choose(ll i)
{
return i*(i - 1) / 2;
}
int... | #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 ... | 0 | 40,690,228 |
#include"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<ll> A(N), C(N + 1, 0);
for (ll i = 0; i < N; i++) {
cin >> A[i];
C[A[i]]++;
}
vector<ll> D(N + 1, 0);
for (ll i = 1; i <= N; i++) {
D[C[i]]++;
}
vector<ll> sum... | #include <iostream>
#include <algorithm>
using namespace std;
static const int MAX_N = 50000;
static const int MAX_M = 20;
static const int INF = (1 << 30);
int main(void) {
int n, m;
int C[MAX_M+1];
int T[MAX_N+1];
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> C[i];
}
T[0] = ... | 0 | 5,213,729 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
int main() {
string s, in;
while (cin >> in)
s += in;
for (char c = 'a'; c <= 'z'; c++)
cout << c << " : " << count(s.begin(), s.end(), c) + count(s.begin(), s.end(), toupper(c)) << endl;
} | #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()
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD... | 0 | 58,642,098 |
#include<stdio.h>
int main(){
int a[256],b=0,i=0;
scanf("%d",&a[b]);
while(a[b]!=0){
i++;
printf("Case %d: %d\n",i,a[b]);
scanf("%d",&a[b]);
}
return(0);
} | #include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define ld long double
#define ff first
#define ss second
const ll mod = 1e9 +7 ;
ll multiply(ll a, ll b ){ return ((a % mod) * (b % mod)) % mod; }
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll sub(ll a, ll b) { return ((a%mod) ... | 0 | 13,755,006 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long l... | #include <bits/stdc++.h>
using namespace std;
#define froop1(a,n) for(int i = a;i < n;i++)
#define froop2(a,n) for(int i = a;i > n;i--)
int main(){
long long N,sw= 0,sw2 = 0;
cin >> N >> sw2;
long long count = 1;
froop1(0,N){
int a;
cin >> a;
if(a % 2 != 0){
sw = 1;
}
count *= 2;
}
... | 0 | 70,520,420 |
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int, int> P;
int main(){
long H, W, N;
P xy[9];
xy[0] = P(-1, -1), xy[1] = P(0, -1), xy[2] = P(1, -1);
xy[3] = P(-1, 0), xy[4] = P(0, 0), xy[5] = P(1, 0);
xy[6] = P(-1, 1), xy[7] = P(0, 1), xy[8] = P(1, 1);
map<P... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,... | 0 | 55,130,823 |
#include<iostream>
using namespace std;
int main()
{
int d;
while(cin>>d)
{
int y=0;
for(int i=1; i*d<600; i++)
{
y+=d*(d*i)*(d*i);
}
cout<<y<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
cin >> n;
vector<int> c(n - 1), s(n - 1), f(n - 1);
rep(i, n - 1)
{
cin >> c[i] >> s[i] >> f[i];
}
rep(i, n - 1)
{
int t = 0;
... | 0 | 84,231,010 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i, k , n) for(int i = k; i <= n; i++)
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
int main()
{... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n;
cin>>n;
rep(i,999){
int a=n/1... | 0 | 38,902,203 |
#include<bits/stdc++.h>
#define EPS (1e-10)
#define equals(a,b)(fabs((a)-(b))<EPS)
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
struct Point {
double x, y;
Point(double x = 0, double y = 0) :x(x), y(y) {}
Point operator*(double a) { return Point(a*x, a*y); }
Point operator-(Point p) { return Point(x - ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define txti freopen("input.txt", "r", stdin);
#de... | 0 | 45,498,504 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
struct edge{ll to,cost;};
const int inf = 1<<28;
const ll INF = 1LL<<53;
const int COMBMAX = 500005;
const ll MOD = 1e9+7;
#define _... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, ss, ee) for (int i = (ss); i < (ee); ++i)
using Vi = vector<int>;
using VVi = vector<Vi>;
void solve() {
int N, D;
cin >> N >> D;
VVi v(N, Vi(D));
for (auto &e1 : v)
for (auto &e2 : e1) cin >> e2;
int ans = 0;
rep(i, 0, N - 1) {
rep(j, i +... | 0 | 53,372,127 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll dep(ll a, ll b){
if(b==0){
return a;
}
return dep(b,a%b);
}
int main() {
ll n;
cin>>n;
if(n%2!=0){
cout << 0;
return 0;
}
ll now=10;
ll ans=0;
while(now<=n){
ans+=n/now;
now*=5;
}
cout... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, x, n) for (ll i = ... | 0 | 58,027,967 |
#include<iostream>
#include<map>
#include<list>
#include<queue>
#include<vector>
#include<algorithm>
#include<climits>
using namespace std;
#define int long long
#define lmax LLONG_MAX
#define lmin LLONG_MIN
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define vi vector<int>
#de... | #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;
typedef long long ll;
typedef unsigned long long lu;
typedef long double ld;
typedef pair<ll,ll> pr;
typedef vector<ll> v;
typedef vector<vector<ll> > vv;
typedef vector... | 0 | 12,201,961 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll a, b, c, k; cin >> a >> b >> c >> k;
ll ans = 0;
if (k%2) ans = b - a;
else ans = a - b;
cout << ans ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
string s;
cin>>n>>s;
vector<ll> r(n,0),g(n,0),b(n,0);
rep(i,n){
if(s[i]=='R'... | 0 | 4,424,100 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+... | #include <iostream>
#include <queue>
using namespace std;
struct locate{
int x;
int y;
};
char graph[20][20];
int cou = 0;
int H,W;
void bfs(locate z){
queue<locate> Q;
locate u;
locate v;
Q.push(z);
while(!Q.empty()){
u = Q.front();Q.pop();
if(u.y < H - 1){
if(graph[u.y + 1][u.x] == '.' && ... | 0 | 93,718,303 |
#include <iostream>
using namespace std;
const int N = 44;
int dp[N] = {};
int n;
int rec(int x)
{
if(x == 0 || x == 1){
dp[x] = 1;
return dp[x];
}
if(dp[x] != 0)
return dp[x];
return dp[x] = rec(x - 1) + rec(x - 2);
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cout << rec(n) << endl;... | #include <iostream>
#include <algorithm>
#include <vector>
int main()
{
std::vector<int> vec;
int a;
for(int i = 0; i < 10; ++i)
{
std::cin >> a;
vec.push_back(a);
}
std::sort(vec.begin(),vec.end());
for(int i = 0; i < 3; ++i) std::... | 0 | 6,423,854 |
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double weeks=0;
double debit=100.0;
cin >> weeks;
for(int i=0; i<weeks;i++){
debit=debit+debit*0.05;
debit=ceil(debit);
}
int out =debit*1000;
cout <<out<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
void rec(pair<double, double> p1, pair<double, double> p2, int depth, vector<pair<double, double> >& v)
{
if (depth <= 0) {
v.push_back(p2);
return;
}
pair<double, double> s, t, u;
s.first = p1.first + (p2.first - p... | 0 | 74,784,995 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll dpa[100005],dpb[100005],dpc[100005];
int main()
{
ll n;
cin>>n;
ll a[n],b[n],c[n];
for(int i=0;i<n;i++){
cin>>a[i]>>b[i]>>c[i];
}
dpa[n-1]=a[n-1];
dpb[n-1]=b[n-1];
dpc[n-1]=c[n-1];
for(int i=n-2;i>=0;i-- ){
dpa[i]=a[i]+max(d... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | 0 | 34,465,047 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include<stdio.h>
int main(){
int n,x,i,j,k,b=0,a[101]={0};
while(1){
scanf("%d %d",&n,&x);
if(n==0&&x==0){
break;
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(j!=i){
for(k=1;k<=n;k++){
if(k!=i&&k!=j){
if(i+j+k==x){
a[b]++;
}
}
}
... | 0 | 60,420,714 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | #include<bits/stdc++.h>
using namespace std;
const int N=1e5+1;
bool v[N];
int n,m,x,y,c[N],q[N],t,X;
vector<int>a[N];
int main()
{
cin>>n;
m=n-1;
while(m--&&cin>>x>>y)
a[x].push_back(y),a[y].push_back(x),c[x]++,c[y]++;
for(int i=1;i<=n;i++)
if(c[i]==1)
q[++t]=i;
while(t)
{
X=q[t--];
if(v[X])
contin... | 0 | 65,359,299 |
#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>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int H, N;
int su = 0;
cin >> H >> N;
rep(i, N)... | 0 | 71,137,145 |
#include <bits/stdc++.h>
using namespace std;
#define ld long double
int main() {
int n, k;
ld ans, tmp;
scanf("%d %d", &n, &k);
ans = 0.0;
for (int i = 1; i <= n; i++) {
tmp = 1.0 / n;
for (int j = i; j < k; j *= 2) {
tmp *= 1.0/2.0;
}
ans += tmp;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin >> N >> K;
vector<int> perm(N);
for(int i=0; i<N; i++){
cin >> perm.at(i);
perm.at(i)--;
}
vector<int64_t> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
int logK= 31- __builtin_clz(K);
vector<vector<int>> tra... | 0 | 9,942,360 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | #include<bits/stdc++.h>
int main(){
int N,K;
std::cin>>N>>K;
std::vector<long long> a(N);
for(int i=0;i<N;++i) std::cin>>a[i];
long long ans=1e18;
for(int bit=0;bit<(1<<N);++bit){
if(__builtin_popcount(bit)<K) continue;
long long tmp=0,height=0;
for(int i=0;i<N;++i){
... | 0 | 38,569,548 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,c=0,n,p=0,g,j,r;
int a[1000]= {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cin>>n;
for(i=0;; i++)
{
c++;
if(c==n)
{
cout<<a[i]<<endl;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
long long K;
cin>>S;
cin>>K;
vector <int> a(100,0);
long long ans=0;
long long serial=0;
long long temp=0;
int on=0;
bool flag=1;
for(int i=1;i<S.length();i++){
if(S.at(i)!=S.at(0)){
flag=0;
}
}
if(flag){
cou... | 0 | 53,753,587 |
#include <iostream>
using namespace std;
int n, a, b, c, x;
int next_rand() {
x = (a * x + b) % c;
return x;
}
int main() {
while (cin >> n >> a >> b >> c >> x) {
if ((n || a || b || c || x) == 0) break;
int slot[n];
for (int i = 0; i < n; i++) cin >> slot[i];
int frame = 0;
... | #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 oldt = 0, oldx = 0, oldy = 0;
bool can = true;
int t, x, y;
rep(i,n) {
cin >> t >> x >> y;
int dt = t - oldt;
int dx = x-old... | 0 | 4,131,246 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long llong;
#define BINARY_CHILDREN_NUM 2
#define NIL 2100000000
#define MAX 300
struct Node {
int key;
Node *left, *right, *parent;
};
struct BinaryHeap {
int key, left, right, parent;
};
struct BinaryHeap Heap[MAX];
bool ... | # include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 77 , Mod = 1e9 + 7;
long long X,Y;
int main(){
cin >> X >> Y;
if(abs(X - Y) <= 1)return cout << "Brown",0;
cout << "Alice";
return (0);
} | 0 | 7,447,724 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
int main(){
ll N, M;
cin >> N >> M;
vector<pair<ll, ll> >AB(N);
rep(i, N) {
cin >> AB[i].first >> AB[i].second;
}
sort(AB.rbegin(), AB.rend());
priority_queue<ll> Q;
... | #include <iostream>
using namespace std;
int main(void){
long Num, Value, Min, Max, Sum;
std::cin >> Num;
Sum = 0;
for(long i = 0; i < Num; i++){
std::cin >> Value;
if(i == 0){
Min = Value;
Max = Value;
} else{
if(Value < Min) Min = Value;
... | 0 | 9,383,811 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<cstring>
#include<complex>
#include<cmath>
#include<algorithm>
#include<list>
#include<functional>
#define mp make_pair
#define X first
#define Y second
#define INF... | #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()
{
ll m; cin >> m;
ll d[m],c[m];
ll dig = 0;
ll sum = 0;
... | 0 | 6,457,001 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <map>
#include <list>
#include <math.h>
#include <algorithm>
#include <chrono>
#include <random>
#include <queue>
#include <fstream>
#include <iterator>
#include <chrono>
#include <string>
using namespace std;
int main(int argc, char *... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int n=0;
int ans=0;
int t=0;
for(int i=0;i<3;i++){
if(s[i]=='R'){
t++;
}
}
if(t==3){
ans=3;
}
if(t==0){
ans=0;
}
if(t==1){
ans=1;
}
if(t==2){
if(s[1]=='R'){
ans=2;
}
else{
... | 0 | 8,582,193 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, m, d;
cin >> n >> m >> d;
ll cnt = 0;
for(int i=1; i<=n; ++i){
if(d == 0){ ++cnt; continue;}
if(i-d >=1) ++cnt;
if(i+d <=n) ++cnt;
}
cnt *= m-1;
double ans = (double)cnt /n /n;
printf("%.10f", ans);
} | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
long long a, l = 1, m, n, p, q;
bool bad = false;
cin >> n >> m;
for (int i = 0; i < n; i++){
cin >> a;
a >>= 1;
p = (-a) & a;
if (i){
if (p != q){
bad = true;
... | 0 | 58,341,794 |
#include<bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x).size()
#define pb push_back
#define ll long long
#define xmax(x, y) (x) = max((x), (y))
#define xmin(x, y) (x) = min((x), (y))
#define F first
#define S second
#define pii pair<int, int>
#define pll pair<long long, long long>
#define int long long
#def... | #include <iostream>
using namespace std;
int main() {
int n, i, max, max2;
bool t;
cin>>n;
int v[n], v2[n];
max = 0;
for(i=0;i<n;i++){
cin>>v[i];
}
for(i=0;i<n;i++){
if(v[i]>max){max = v[i];}
}
for(i=0;i<n;i++){
if(v[i]>max/2){
v[i] = max-v[i];... | 0 | 55,275,741 |
#include<iostream>
using namespace std;
struct Card { char suit, value; };
void BubbleSort(struct Card A[], int N) {
for (int i = 0; i <= N - 1; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (A[j].value < A[j - 1].value) swap(A[j], A[j - 1]);
}
}
}
void SelectionSort(struct Card A[], int N) {
int minj;
fo... | #include<iostream>
using namespace std;
int main()
{
int a1,b1,c1,d1,a2,b2,c2,d2,T1,T2,T;
cin >> a1 >> b1 >> c1 >> d1;
cin >> a2 >> b2 >> c2 >> d2;
if(a1>100){
cout << "エラー" << endl;
return 0;
}
if(b1>100){
cout << "エラー" << endl;
return 0;
}
if(c1>100){
cout << "エラー" << endl;
... | 0 | 92,397,418 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(ll i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
ll n, ans = 0;
cin >> n;
vector... | #include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
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;
s... | 0 | 24,457,143 |
#include <iostream>
using namespace std;
int main(){
int a;
int b;
cin >> a >> b;
if(a>b){
cout << "a" << " > " << "b" << endl;
}
if(a==b){
cout << "a" << " == " << "b" << endl;
}
if(a<b){
cout << "a" << " < " << "b" << endl;
}
} | #include <iostream>
using namespace std;
int main()
{
while (true)
{
int n, x;
cin >> n >> x;
if (n == 0 && x == 0)
return 0;
int count = 0;
for (int i = 1; i <= n; i++)
{
for (int j = i + 1; j <= n; j++)
{
for (int k = j + 1; k <= n; k++)
{
if (i ... | 0 | 8,115,201 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define rep1(i,n) for (int i=1; i<=(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define fst first
#define scd second
#define pb push_back
using namespace std;
using ll = long long;
u... | 0 | 62,471,780 |
# include <bits/stdc++.h>
using namespace std;
namespace Base{
# define mr make_pair
typedef long long ll;
typedef double db;
const int inf = 0x3f3f3f3f, INF = 0x7fffffff;
const ll infll = 0x3f3f3f3f3f3f3f3fll, INFll = 0x7fffffffffffffffll;
template<typename T> void read(T &x){
x = 0; int fh = 1; double num... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int cnt = 0, flag = 0;
for (int i = 1; i < 4; i++)
{
if (s[i - 1] == s[i])
{
cnt++;
if (cnt > 1)
{
flag = 1;
break;
}
... | 0 | 74,276,211 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
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... | #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... | 0 | 6,035,744 |
#include <iostream>
#include <stack>
#include <stdio.h>
using namespace std;
double a,b,c;
double x[4],y[4];
void make_line(double x1,double y1,double x2,double y2){
if(x1!=x2&&y1!=y2){
a=(y1-y2)/(x1-x2);
b=-1;
c=-a*x1+y1;
}else if(x1==x2){
a=1;
b=0;
c=-x1;
}else if(y1==y2){
a=0;
b=1;
c=-y1;
}
re... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string sam="abcdefghijklmnopqrstuvwxyz";
vector<int> num(26);
for(int i=0; i<s.size(); i++){
for(int j=0; j<26; j++){
if(s.at(i)==sam.at(j)){
num.at(j)++;
break;
}
}
}
bool judge=true;
for(int i=0; i<26; i++){
if(n... | 0 | 75,262,018 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<cmath>
#include<string>
#include<queue>
#include<iomanip>
#include<bitset>
#include<math.h>
#include<stack>
#include<set>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(0);
cin.tie();
co... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
ll sum_... | 0 | 78,448,643 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<string> strN(N);
for (int i=0; i<N; i++) cin >> strN.at(i);
cin >> M;
vector<string> strM(M);
for (int i=0; i<M; i++) cin >> strM.at(i);
int ans = 0;
map<string, int> table;
for (int i=0; i<N; i++) table[strN.at(... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
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 ... | 0 | 79,757,491 |
#include <iostream>
#include <iomanip>
#include <fstream>
#include <stdio.h>
#include <math.h>
#include <time.h>
#include <string>
#include <tuple>
#include <vector>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n,in,t;
cin>>t;
vector<ll>v;
ll sum=0;
for(ll i=0;i<t;i++)
{
cin>>in;
sum+=in;
v.push_back(in);
}
ll s,d=0;
ll... | 0 | 34,975,815 |
#include<bits/stdc++.h>
using namespace std;
int a[100002], f[100002], mx, n;
int main()
{
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
f[a[i]]++;
mx = max(mx, a[i]);
}
for (int i = 1; i <= n; i++)
if (a[i] < (mx + 1) / 2) {
cout << "Impossible";
return 0;
}
if (f[(mx + 1) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define rep(i,n) REP(i,0,n)
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll sum = accumulate... | 0 | 21,525,253 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define sigma_size 30
#define max_size (int)(1e5+10)
#define MAX (int)(1e5+7)
int qread()
{
char c; int s=0,t=1; while ((c=getchar())<'0' || c>'9') (c=='-' && (t=-1));
do s=s*10+c-'0'; while ((c=getchar())>='0' && c<='9'); return s*t;
}
int main ()
{
... | #include <bits/stdc++.h>
using namespace std;
using A=vector<pair<long long,long long>>;
A prime_factorize(long long N){
A res;
for(long long i=2;i*i<=N;i++){
if(N%i!=0){
continue;
}
long long ex=0;
while(N%i==0){
ex++;
N/=i;
}
res.push_back(make_pair(i,ex));
}
if(N!=1... | 0 | 22,570,555 |
#include <iostream>
using namespace std;
int main(){
string str;
cin >> str;
int type = 1;
char c = str[0];
for(int i=0; i<str.length(); i++){
if(str[i] != c){
type++;
c = str[i];
}
}
cout << type-1 << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
map<int, int> factorization;
for (int i = 2; i <= N; ++i) {
int n = i;
for (int j = 2; j * j <= i; ++j) {
while (n % j == 0) {
if (factorization.count(j) == 0) {
f... | 0 | 14,123,472 |
#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define per(i,a,b) for(ll i=a; i>=b; i--)
#define ll long long int
#define ld long double
#define vi vector<ll>
#define pi pair<ll,ll>
#define vii vector <p... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cctype>
#include <numeric>
using namespac... | 0 | 66,421,497 |
#include<iostream>
#include<vector>
using namespace std;
void cs(vector<int> &a,vector<int> &b,vector<int> &c,int n){
for(int i=1;i<10001;++i) c[i]=c[i]+c[i-1];
for(int i=n-1;i>=0;--i){
b[c[a[i]]-1]=a[i];
c[a[i]]--;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
vector<ll> v(N + 1);
if (N == 0){
cout << 2 << endl;
return 0;
}
if (N == 1){
cout << 1 << endl;
return 0;
}
v[... | 0 | 1,688,083 |
#include<bits/stdc++.h>
using namespace std ;
int main() {
int D ;
cin >> D ;
if(D == 25){
cout << "Christmas" << endl ;
}
if(D == 24){
cout << "Christmas Eve" << endl ;
}
if(D == 23){
cout << "Christmas Eve Eve" << endl ;
}
if(D == 22){
cout << "Christmas Eve Eve Eve" << e... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n<=111)
cout<<111<<"\n";
else if(n<=222)
cout<<222<<"\n";
else if(n<=333)
cout<<333<<"\n";
else if(n<=444)
cout<<444<<"\n";
else if(n<=555)
cout<<555<<"\n";
else if(n<=666)
cout<<666<... | 0 | 96,708,203 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#define ALL(x) (x).begin(),(x).end()
using namespace std;
const int MAXN = 200005;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
for (int i = 0; i < (int)v.size(); ++i) os << v[i] << " ";
return os;
}
int main()
{
int ... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include... | 0 | 90,042,653 |
#include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.e... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 60,576,137 |
#include<stdio.h>
#include<bits/stdc++.h>
using namespace std;
int main()
{ ios_base::sync_with_stdio(false); cin.tie(NULL);
string s1,s2;
cin>>s1 >> s2;
int count =0 ;
for(int i=0; i<s1.length(); i++)
if(s1[i] != s2[i])
count++;
cout<<count<<"\n";
return 0;
} | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 45,648,867 |
#include "bits/stdc++.h"
#include <chrono>
#include <random>
#include <cstdio>
#define ll long long int
#define endl '\n'
#define pb push_back
#define mp make_pair
#define rep(i,n) for(ll i=0;i<n;i++)
#define vi vector <int>
#define vs vector <string>
#define vc vector <char>
#define vl vector <ll>
#define pll pair<ll,... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
ll a, b, c, k;
cin>>a>>b>>c>>k;
int ans = min(a, k);
k -= ans;
k -= min(b, k);
an... | 0 | 59,968,871 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | 0 | 54,494,912 |
#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;
int main()
{
string s;
cin >> s;
int l = s.size();
string ans = "AC";
if (s[0] != 'A')
{
ans = "WA";
}
int cnt = 0;
for (int i = 1; i < l; i++)
{
if (isupper(s[i]))
{
if (i == 1 || i == l - 1 || s[i... | 0 | 10,315,815 |
#include <bits/stdc++.h>
struct CARD {
char mark;
char num;
int index;
};
void selectionSort(CARD* A, int N){
int minj;
for(int i = 0; i < N - 1; i++){
minj = i;
for(int j = i; j < N; j++){
if(A[j].num < A[minj].num)
minj = j;
}
if(minj != i){
CARD tmp = A[i];
A[i] = ... | #include<iostream>
#include<vector>
using namespace std;
struct Node{
int parent = -1;
int depth;
vector<int> child;
};
class Tree{
int root = -1;
vector<Node> node;
void calc_root(){
int i = 0;
for (int i = 0; ; i++) {
if (node[i].parent == -1) {
root... | 0 | 100,089,198 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
const int INF = 1001001001;
int main(){
int n; cin>>n;
map<string,int> mp;
string s,t;
bool ok = true;
for(int i=0; i<n; i++){
cin>>s;
if(mp.count(s)) ok = false;
if(i && s... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;... | 0 | 99,472,118 |
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
int n;
int a[105],minn,minnum,maxx,maxnum,num[105];
int main()
{
scanf("%d",&n);
minn=1e9,maxx=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]),minn=min(minn,a[i]),maxx=max(maxx,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef vector<pii> vpii;
typedef vector<pil> vpil;
typedef vector<pli> vpli;
typedef set<i... | 0 | 29,122,130 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 10000... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | 0 | 53,957,038 |
#include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <int , int>;
void in(int &x);
const int N = 1e5 + 10;
#define singleCase
int n,c,k,t[N];
void work() {
i... | #include <bits/stdc++.h>
using namespace std;
#define print cout <<
class StrProc{
public :
string removeTargetStr(string rowStr, string target){
int start_idx = rowStr.find(target);
while(start_idx!=string::npos){
rowStr.replace(start_idx,target.size(),"");
start_idx = rowStr.find(tar... | 0 | 45,694,670 |
#include <iostream>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <limits.h>
using namespace std;
typedef long long LL;
#define rep(i,n) for (int i = 0; i... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(lon... | 0 | 99,218,933 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
bool is_d(char c) {
if('1' <= c && c <= '9') return true;
return false;
}
in... | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll a, b, k;
cin >> a >> b >> k;
for(int i = 0; i < k; i++){
if(i % 2){
b /= 2;
a += b;
}
else{
a /= 2;
b += a;
}
}
cout << a << " " << b << endl... | 0 | 65,667,869 |
#include "iostream"
#include "string"
int main()
{
int h, m;
std::string str, temp;
while(1){
std::cin >> str;
if(str == "-") break;
std::cin >> m;
for(int i = 0; i < m; i++){
std::cin >> h;
temp = str.substr(0, h);
str = str.substr(h, str.... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define mid ((l+r)>>1)
const int M=3e5+20,P=1e9+7;
struct Task{
LL n,m,v,p,a[M];
LL sum[M];
void run(){
init();
sort(a+1,a+n+1);
for(int i=1;i<=n;++i){
sum[i]=sum[i-1]+a[i];
}
LL ans=n-p;
wh... | 0 | 84,681,147 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | #include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define mem0(x) memset(x,0,sizeof(x))
#define meminf(x) memset(x,0x3f,sizeof(x))
#define VI vector<int>
#define VL vector<ll>
using namespace ... | 0 | 85,671,568 |
#include<iostream>
#include <string>
#include <iomanip>
using namespace std;
int main()
{
double L;
cin >> L;
double x = L / 3;
cout << fixed << setprecision(20) << x * x * x << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 | 54,523,762 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(long long i=0; i<(int)n; i++)
#define rep2(i,a,n) for(long long i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pair<int, int>;
u... | #include <iostream>
#include <vector>
#include <algorithm>
#include <sstream>
#include <string>
using namespace std;
string IntToString(int);
int StringToInt(string);
int main(){
while(1){
int n,m;
cin >> n >> m;
if(n == 0 && m == 0)break;
vector<pair<int,int> > d_p(n);
for(int i = 0;i < n;i++){
... | 0 | 94,301,615 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main() {
int n;
cin>>n;
int m[n+1][n+1],p[n+1];
rep(i,n){
cin>>p[i]>>p[i+1];
m[i][i]=0;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<int> H(N);
vector<int> high(N, 1);
for (int i=0 ; i<N ; i++){
cin >> H.at(i);
}
vector<int> A(M);
vector<int> B(M);
for (int i=0 ; i<M ; i++){
cin >> A.at(i) >> B.at(i);
if (H.at(A.at(i)-1) > H.at(B.a... | 0 | 71,798,035 |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | #include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int n, mi, ma;
while(cin >> n >> mi >> ma, n) {
vector<int> v(n);
int gap=0, ans=0;
for(int i=0; i<n; ++i) {
cin >> v[i];
}
for(int i=mi-1; i<ma; ++i) {
if(gap... | 0 | 35,374,168 |
#include<math.h>
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long int
#define py printf("Yes\n")
#define pn printf("No\n")
#define in cin>>
using namespace std;
const int INF = 1001001001;
int main()
{
int n,d,x,ans=0;
in n>>d>>x;
vector<i... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_... | 0 | 77,001,691 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
if (m1 < m2) {
h2--;
m2 += 60;
}
int up = (h2 - h1) * 60 + (m2 - m1);
cout << up - k << endl;
return 0;
} | #include<iostream>
using namespace std;
#define df 0
int main(){
if(df) printf("*debug mode*\n");
int n,a,b; cin >> n >> a >> b;
if(n>(long int)a*b || n<a+b-1){
cout << "-1\n";
return 0;
}
if(a==1){
for(int i=n;i>0;i--){
cout << i << (i!=1? " ":"\n");
}
return 0;
}
int q=(n-b)/(a... | 0 | 69,892,294 |
#include <bits/stdc++.h>
using namespace std;
int findSumOfDigits(int n){
int sum = 0;
while(n > 0){
sum += n%10;
n /= 10;
}
return sum;
}
int main() {
int n;
cin >> n;
int sum = findSumOfDigits(n);
if(n%sum == 0){
cout << "Yes" << endl;
}
else cout << "No" << endl;
} | #include <iostream>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cmath>
#include <cstdarg>
#include <cstdlib>
#include <string>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define MAX_N 10
typedef pair<int, int> pint;
class Permutati... | 0 | 73,015,496 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
static const int INF = INT_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1e9+7;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<class... | 0 | 65,084,899 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #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 FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll mod2 = 99824... | 0 | 33,196,521 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | #include<iostream>
using namespace std;
struct Cube{
Cube(){}
int d[6];
void roll(int i,int j,int k,int l){
int t=d[i];d[i]=d[j];d[j]=d[k];d[k]=d[l];d[l]=t;
}
void z(){roll(1,2,4,3);}
void y(){roll(0,2,5,3);}
void x(){roll(0,1,5,4);}
void n(){x();}
void s(){x(),x(),x();}
... | 0 | 44,400,805 |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using ll = long long;
ll depth[100010];
using Graph = vector<vector<Edge>>;
void dfs(Graph &graph, int currentPoint, int parentPoint, ll totalWeight) {
depth[currentPoint] = totalWeight;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(ll (i)=0; (i)<(n); ++(i))
#define pr... | 0 | 18,836,982 |
#include <iostream>
using namespace std;
int main()
{
int n , a;
cin >> n;
for (int i = 0 ; i < 3 ; i++){
a = n % 10;
if (a == 7){
cout << "Yes";
return 0;
}
n /= 10;
}
cout << "No";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v)... | 0 | 25,408,731 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#include... | #include<stdio.h>
int main(void)
{
int a,b,c,d,e,f,o,s,m;
scanf("%d",&m);
while(m!=0){
a=0;
b=0;
c=0;
d=0;
e=0;
f=0;
s=0;
o=1000-m;
a=o/500;
o=o-500*a;
b=o/100;
o=o-100*b;
c=o/50;
o=o-50*c;
d=o/10;
o=o-10*d;
e=o/5;
o=o-5*e;
f=o/1;
o=o-1*f;
s=a+b+c+d+e+f;
printf("%d\n",s);
s... | 0 | 34,383,725 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int A, B, K, M;
cin >> A >> B >> K;
M=min(A,B);
vector<int> C(M);
for (int i=0; i<M; i++) {
if (A%(i+1)==0 && B%(i+1)==0) {
C[i]=i+1;
}
else {
C[i]=-1;... | #include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <cmath>
using namespace std;
void solve(){
int h, w, ans = 0; cin >> h >> w;
char c[h][w];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> c[i][j];
}
... | 0 | 94,127,756 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
const ll I... | #include <bits/stdc++.h>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
const ll mod = 1000000007;
const ll N = 200005;
const ll inf = 10000000000000000;
... | 0 | 43,422,355 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
ll x, y; cin >> x >> y;
if (fabs(x - y) <= 1) cout << "Brown" << endl;
else cout << "Alice" << endl;
return 0;
} | #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 rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | 0 | 62,324,387 |
#include<iostream>
using namespace std;
int main()
{
int k;
int n;
cin>>k>>n;
if(k*500>=n)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #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;
typedef long long ll;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
ll k;
void dfs(ll cur,ll d, vector<vector<... | 0 | 66,390,336 |
#include<iostream>
using namespace std;
int main(){
int n,tou,kai,ban,ninzu;
cin >> n;
int info[4][3][10] = {{{}}};
for(int i=0;i<n;i++){
cin >> tou >> kai >> ban >> ninzu;
info[tou-1][kai-1][ban-1] += ninzu;
}
for(int i=0;i<4;i++){
for(int j=0;j<3;j++){
for(int k=0;k<10;k++){
cout... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main() {
int K;
cin >> K;
int INF = K;
deque<pii> deq;
vector<int> dp(K, INF);
dp[1] = 0;
deq.push_back(pii(dp[1], 1));
while (!deq.empty()) {
int d, n;
tie(d, n) = deq.front();
deq.pop_... | 0 | 27,654,103 |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef pair<int,int> pii;
int N, M;
pii PD[10010];
int main() {
while (true) {
scanf("%d %d", &N, &M);
if (N == 0 && M == 0) break;
for (int i=0;i<N;i++) {
int D, P;
scanf("%d %d", &D, &P);
PD[i] = pii(-P, D);
}
sort(PD... | #include <bits/stdc++.h>
const int MOD = 1000000007;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define sort(a) sort(a.begin(), a.end())
#define reverse(s) reverse(s.begin(), s.end())
#define p(s) cout << (s) << endl
typedef long long ll;... | 0 | 22,170,974 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
using namespace std;
int main()
{
int ans, n,m;
cin >> n >> m;
cout << n-m+1 << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(),... | 0 | 21,268,000 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int a,b,x;
cin>>a>>b>>x;
if (x>=a && (x-a)<=b)
cout<<"YES\n";
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
typedef long long LL;
using namespace std;
LL GCD(LL x, LL y){
... | 0 | 61,574,116 |
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>> n ;
int a,b ;
cin>>a>>b ;
bool flag=false ;
for(int i=a;i<=b;i++){
if(i%n==0)
{
flag=true ;
break ;
}
}
if(flag==true)
cout<<"OK";
else
cout<<"NG" ;
}
int main(){
int y ;... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll I... | 0 | 99,835,609 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | #include <algorithm>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<pair<int64_t, int>> DT(N);
rep(i, N) { cin >> DT[i].se... | 0 | 97,292,148 |
#include<iostream>
using namespace std;
int main()
{
while (1){
int n;
char qq[1000], ww[1000];
cin >> n;
if (n == 0)break;
for (int i = 0; i < n; i++)
{
cin >> qq[i] >> ww[i];
}
int len = 0;
cin >> len;
while (len--)
{
char u;
cin >> u;
for (int i = 0; i < n; i++)
{
if (qq[i] ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
map<ll,ll>m;
ll a[222222];
ll n,k;
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++)a[i]=(a[i-1]+a[i]-1)%k;
ll ans=0;
m[0]++;
for(int l=0,r=1;r<=n;r++){
if(r-l==k)m[a[l++]]--;
ans+=m[a[r]];
m[a[r]]++;
}cout<<ans<<e... | 0 | 70,480,675 |
#include <bits/stdc++.h>
using namespace std;
#define print cout <<
class StrProc{
public :
string removeTargetStr(string rowStr, string target){
int start_idx = rowStr.find(target);
while(start_idx!=string::npos){
rowStr.replace(start_idx,target.size(),"");
start_idx = rowStr.find(tar... | #include <algorithm>
#include <vector>
#include <string>
#include <ctype.h>
#include <set>
#include <map>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<time.h>
#include<string>
#include<stack>
#include<cmath>
#include<iostream>
#include<cstring>
#include<complex>
#include<bitset>
#include <climits>
#inclu... | 0 | 98,201,631 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
int main(){
long long H, M;
scanf("%lld", &H);
scanf("%lld", &M);
if (H==1 && M==1){
printf... | #include <bits/stdc++.h>
using namespace std;
int n;
int check(int n) {
for (int i = 1; i*(i-1)/2 <= n; i++) {
if (i*(i-1)/2 == n) return i;
}
return 0;
}
int mp[505][505];
int main() {
scanf("%d", &n);
int k = check(n);
if (!k) puts("No");
else {
puts("Yes");
for (in... | 0 | 21,786,028 |
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <unordere... | #include <iostream>
#include<set>
using namespace std;
int main(void){
int n,m;
set<int>s;
cin>>n>>m;
int H[n];
for(int i=0;i<n;i++)
{
cin>>H[i];
s.insert(i+1);
}
int a,b;
for(int i=0;i<m;i++){
cin>>a>>b;
if(H[a-1] < H[b-1]){
s.eras... | 0 | 39,046,696 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<long long,long long>
#define lg length()
#define pb push_back
ifstream in("file.in");
ofstream out("file.out");
#define MAXN 100005
... | 0 | 91,945,674 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <cstdio>
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define max3(x, y, z) max(x, max(y, z))
#ifdef _MSC_FULL_VER
#define dout ... | 0 | 13,183,420 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin >> N >> A >> B;
int M = 1;
vector<int> sum(N+1,0);
for (int i = 1; i < N+1; i++) {
M = i;
while (M != 0){
sum.at(i) += M % 10;
M = (M - M % 10)/10;
}
}
long long Sum = 0;
for (int i = 1; i < N+1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-7;
const double PI = acos(-1);
typedef pair<int, int> pii;
const int MOD = 998244353;
const int INF = 0x3f3f3f3f;
const int N = 2e5+7;
int n, k;
int a[N];
int add[N];
inline void solve() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[... | 0 | 58,451,145 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
string ans;
if (s[2] == s[3] && s[4] == s[5]) ans = "Yes";
else ans = "No";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
int n;
cin >> n;
vector<int> a(n+1);
vector<int> b(n);
rep(i,n+1) cin >> a.at(i);
rep(i,n) cin >> b.at(i);
ll total = 0;
rep(i,n+1) t... | 0 | 97,412,716 |
#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=n;i<N;i++)
#define p(S) cout<<S<<endl
#define ck(n,a,b) (a<=(n)&&(n)<b)
using namespace std;
int main(){
int N,A,B,C,X;
while(cin>>N>>A>>B>>C>>X,N){
int y,ans=-1;
queue<int> Y;
REP(i,0,N) cin>>y,Y.push(y);
REP(i,0,10001){
if(Y.front()==X) Y.pop();
if... | #include<bits/stdc++.h>
#define ll long long
#define inf 999999999999
#define F first
#define S second
#define pb push_back
#define read(x) freopen("input.txt","r",stdin);
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pi 2*acos(0.0)
#define ee exp(1)
#define mx 100000+100
using na... | 0 | 23,493,736 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | 0 | 15,009,438 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | #include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0;i<ll(n); i++)
int main(){
ll N;
cin >> N;
ll i;
vector<ll> A (N+1, 0);
vector<ll> B (N+1, 0);
vector<ll> C (N+1, 0);
vector<ll> D (... | 0 | 81,902,943 |
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <set>
#include <cstdio>
#include <vector>
#include <iostream>
#include <utility>
#include <queue>
#include <map>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d",&n);
#define gets(s) strin... | #include <bits/stdc++.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
long long mod=1e9+7;
long long INF=1e7;
double EPS = 1e-12;
typedef long long int lld;
double tick(){static clock_t oldt;clock_t newt=clock();double diff=1.0*(newt-oldt)/CLOCKS_PER_SEC;oldt = newt;return diff;}
#define rep(i,a,n) for(l... | 0 | 26,242,036 |
#include<iostream>
using namespace std;
int main(){
int h = 0;
int w = 0;
while (1){
cin >> h >> w;
if (h == 0 && w == 0){
break;
}
for (int i = 0; i < h; i++){
for (int it = 0; it < w; it++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int main(void){
vector<int> array(101,0);
int n,maxi = 0;
while(cin >> n){
array[n]++;
}
for(int i = 1;i < 101;i++){
if(array[i] > maxi){
maxi = array[i];
}
}
for(int i = 1;i < 101;i++){
if(a... | 0 | 41,020,351 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<int, int>
#define F first
#define S second
#define mod 1000000007
#define MOD 998244353
#define INF 40000000000000000
int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1}... | 0 | 25,513,106 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
for(int n;cin>>n && n;){
int prev=0,res=0;
int l=0,r=0;
while(n--){
string s; cin>>s;
if(s=="lu") l=1;
if(s=="ru") r=1;
if(s=="ld") l=0;
if(s=="rd") r=0;
if(l==r && l!=prev)
prev=l,res++;
}
cout<<res<<endl;
}
} | #include <bits/stdc++.h>
#define maxn 200010
using namespace std;
int n,a[maxn],s[maxn],m;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n>>m;
for (int i=1;i<=n;i++) cin>>a[i];
while (m--) {
bool change = true;
for (int i=1;i<=n;i++) s[i]=0;
for (int i=1;i<=n;i++) {... | 0 | 69,284,653 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int modu_a = a%2;
int modu_b = b%2;
if (modu_a * modu_b == 0){
cout << "Even" << endl;
}
else {
cout << "Odd" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define INF 1e9
#define INFL 8e18
#define XX ... | 0 | 56,019,574 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.