code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
string s;
ll n;
cin >>... | #include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main(void)
{
int n;
scanf(" %d", &n);
for(int i = 0; i < n; i++){
int y, m, d;
scanf(" %d %d %d", &y, &m, &d);
int count = 0;
for(int j = m + 1; j <= 10; j++){
if(y % 3 == 0){
... | 0 | 1,051,580 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int w, h, n; cin >> w >> h >> n;
int xl=0, xu=w, yl=0, yu=h;
rep(i,n) {
int x, y, a; cin >> x >> y >> a;... | #include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | 0 | 14,547,020 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL N, A, B;
cin >> N >> A >> B;
if (N < A + B - 1 || N > A * B) {
cout << -1 << endl;
return 0;
}
bool maked = false;
for (int i = 1; i <= B; i++) {
int remain = N - A * i;
if (remain < 0) continue;
int leng... | 0 | 12,666,106 |
#include<bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define all(x) (x).begin() (x).end()
#define rall(x) (x).rbegin() (x).rend()
typedef long long ll;
int main(){
char a;
cin>>a;
if(isupper(a))cout<<"A"<<endl;
else cout<<"a"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | 0 | 2,095,750 |
#include <iostream>
using namespace std;
int main(){
int a;
for(int i=1 ;;i++){
cin>>a;
if (a==0){
return 0;
}
cout << "Case "<< i <<":"<<" "<<a<< endl;
}
} | #include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace ... | 0 | 85,378,160 |
#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 mt make_tuple... | #include <iostream>
#include <cstdio>
using namespace std;
const int N = 1005;
int h,w,a,b,s[N][N];
int main(){
scanf("%d%d%d%d",&h,&w,&a,&b);
for(int i=1;i<=h;++i){
for(int j=1;j<=w;++j){
if(i <= b && j <= a)
s[i][j] = 1;
else if(i > b && j > a)
s[i][j] = 1;
else
s[i][j] = 0;
}
}
for(int i... | 0 | 7,965,312 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string o;
for(auto x:s){
o+='9'-(x-'0')+1;
}
cout << o;
} | #include <iostream>
using namespace std;
#include <string>
int main(){
int n; cin >> n;
string str; cin >> str;
long long r=0,g=0,b=0;
for(int i=0; i<n; i++) {
switch (str.at(i)){
case 'R':
r++;
break;
case 'G':
g++;
... | 0 | 42,073,750 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tree<ll,null_type,less<ll>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define int ll
#define endl "\n"
#define all( x ) x.begin(), x.... | #include <bits/stdc++.h>
using namespace std;
#define pi 2*asin(1.0)
long Comb(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
for(long i=M;i>0;i--){
ans=ans/i;
}
return ans;
}
long Perm(long N,long M){
long ans=1;
for(long i=N;i>N-M;i--){
ans=ans*i;
}
return ans;
}
long GCM(long A,long B)... | 0 | 2,908,760 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define MAXN 200000
int N, D, A;
LL prefixSum[MAXN + 3], answer;
pair<int, int> monsters[MAXN + 3];
int main() {
scanf("%d%d%d", &N, &D, &A);
for (int i = 1; i <= N; i++) {
int X, H;
scanf("%d%d", &X, &H);
monsters[i] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = 1000000007;
int add(int a, int b){
return (a+b)%MOD;
}
int mul(int a, int b){
return((ll)a*b)%MOD;
}
int main(){
ios_base::sync_with_stdio(false);
cout.precision(10);
cout<<fixed;
int n;
... | 0 | 89,997,958 |
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
ll k;... | #include<iostream>
#include<cstdio>
#define INF 1<<30
#define MAX 100000
using namespace std;
class Queue{
private:
int inf[MAX];
int head,tail;
public:
Queue(){
syokika();
}
void syokika(){
head = 0;
tail = 0;
}
void push(int x){
inf[tail]=x;
if(MAX == tail+1)tail = 0;
else tail++... | 0 | 2,487,777 |
#include <iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i < (n) ;i++)
int m,nmin,nmax;
int p[1000];
signed main(void) {
while(true) {
cin >> m >> nmin >> nmax;
if (m == 0) break;
rep (i,m) cin >> p[i];
int n;
int mgap = 0;
int ans = nmin;
for (n = nmin; n <= nmax;n++) {
... | #include <iostream>
#include <stdio.h>
using namespace std;
#define max_t 24 * 60 * 60
int main(){
int n;
while( cin >> n, n ){
int list[max_t] = {};
while( n-- ){
int d_h, d_m, d_s;
int a_h, a_m, a_s;
scanf("%d:%d:%d", &d_h, &d_m, &d_s );
... | 0 | 59,279,054 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,c=1,x=0,v=0,i,p=0;
string s;
cin >> n >> s;
if(n%2!=0)
{
cout << "No" << endl;
return 0;
}
v=n/2;
if(s.substr(0,v)==s.substr(v))
{
cout << "Yes" <<endl;
}
else
{... | #include <cstdio>
#include <algorithm>
int main(){
int a,b,c,d;
int x,y;
scanf("%d %d %d %d",&a,&b,&c,&d);
if(a<b){
x=a;
}
else{
x=b;
}
if(c<d){
y=c;
}
else{
y=d;
}
int sum=x+y;
printf("%d",sum);
} | 0 | 96,253,297 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
string S; cin >> S;
ll K; cin >> K;
ll N = S.size();
if (N == 1) {
cout << K / 2 << endl;
return 0;
}
bool same = true;
rep(i,N) if (S[0] != ... | 0 | 60,913,319 |
#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 <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
struct UnionFind
{
vector<int> data;
UnionFind() {}
UnionFind(int size) : data(size, -1) {}
void unite_set(int x, int y){
x = root(x);
y = root(y);
bool is_unite = (x != y);
if (is_unite){
... | 0 | 90,217,316 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int data[101]={},n,num=0;
while(cin >> n) data[n]++;
for(int i=1;i<=100;i++)if(data[i]>num)num=data[i];
for(int i=1;i<=100;i++)if(data[i]==num)cout<<i<<endl;
return 0;
} | #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... | 0 | 63,955,947 |
#include<iostream>
#include<iomanip>
#include<ios>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
#define MAX_N 10000
using namespac... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N,M;
cin>>N>>M;
vector<bool> isAC(N, false);
vector<int> check(N,0);
int wans=0, cans=0;
int p;
string s;
for(int i=0; i<M; i++){
cin>>p>>s;
if(isAC.at(p-1)) continue;
else{
if(s... | 0 | 11,325,838 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,a,i,k,l;
cin>>n;
map<int,int> m;
for(i=0;i<n;i++){
cin>>a;
if(m.count(a)) m.at(a)++;
else m[a]=1;
}
l=m.size();
vector<int> b(l),s(l);
i=0;
for(auto mm:m){
b.at(i)=mm.second;
i++;
}
sort(b.begin(),b.end());
s.at(... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ul;
typedef unsigned long long ull;
typede... | 0 | 96,914,957 |
#include <iostream>
using namespace std;
int main() {
int W, H, N;
int x[110];
int y[110];
int a[110];
cin >> W >> H >> N;
int A[W][H];
for(int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> a[i];
}
for(int j = 0; j < W; j++) {
for(int k = 0; k < H; k++) {
A... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin() , (v).end()
#define vi vector <ll>
#define vii vector <pair<ll,ll>>
#define ii pair<int,int>
#define lp(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define F first... | 0 | 87,451,856 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using P = pair<i64, i64>;
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define all... | 0 | 27,701,512 |
#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... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
class Edge{
public:
int from,to,value;
Edge(LL a,LL b,LL c){
from = a;
to = b;
value = c;
}
Edge(LL a,LL b){
fro... | 0 | 16,409,795 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int MAX = 100;
const long long INF = 1e10;
long long M[MAX][MAX];
int main(){
int V, E;
cin >> V >> E;
rep(i,V){
rep(j,V){
if(i == j){
M[i][j] = 0;
}else{
... | #include <bits/stdc++.h>
using namespace std;
const int INF=100000000;
const int MAX=1000;
typedef pair<int, int> P;
int N, M;
int sx, sy;
int gx[10], gy[10];
char maze[MAX][MAX];
int d[MAX][MAX];
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int bfs(int g)
{
queue<P> que;
for(int i=0; i<N; i++)
for(int j=0; j<M; j++)
... | 0 | 61,212,424 |
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
int main(){
while(true){
int n, m, p;
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0){ break; }
vector<int> x(n);
for(int i = 0; i < n; ++i){ cin >> x[i]; }
int sum = accumulate(x.begin(), x.end(), 0);
int answer = 0;
if(x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define chmax(x,y) x = max(x,y)
int dist(int D, vector<int> a, vector<int> b){
int res = 0;
rep(i,D){
res += (a[i] - b[i]) * (a[i] - b[i]);
}
return res;
}
bool ... | 0 | 35,362,049 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const ll p = 1e9 + 7;
#define DEBUG(x) cout << (x) << '\n'
#define fi first
#define se second
int n, a[MAXN];
void run(){
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
int mx = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long mod = 1e9 + 7;
const int iINF = 0x3f3f3f3f;
const long long INF = 1LL << 60;
using namespace std;
template <class T>
inline bool chmin(T &a, T b)
{
... | 0 | 5,434,135 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 998244353;
LLONG lengths[51], patties[51];
LLONG GetPattyNum... | #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 | 59,039,349 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define RS resize
#define CLR clear
#define PB push_back
#define ALL(x) ... | 0 | 44,015,292 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const long long INF = 1000000000000;
const long long N = 10000;
long long n,m;
struct edge{
long long from,to,cost;
}w[N];
long long d[N];
void path(long long s){
for(long long i=0;i<n;i++) d[i]=INF;
d[s] = 0;
while... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a;
while(cin>>a,a){
map<string,string>s;
for(int b=0;b<a;b++){
string c,k;
cin>>c>>k;
s.insert(pair<string,string>(c,k));
}
int d;
cin>>d;
string r="";
for(int e=0;e<d;e++){
string t;
cin>>t;
if(s[t].empty()==true)s[t]=t;;
r+=s[t];
}
cout<<r<<... | 0 | 75,490,575 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define println(x) cout << x << endl
#define fi first
#define se second
#define Yes println("Yes")
#define No println("No")
#def... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<vector<int>> data(N, vector<int>(26,0));
for (int i = 0; i < N; i++) {
string S;
cin >> S;
for (int j = 0; j < S.size(); j++) {
int M = S.at(j) - '0';
data.at(i).at(M-49)++;
}
}
vector<int>A(26);
... | 0 | 84,354,392 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
1<=a,b,c,d<=10;
cin>>a>>b>>c>>d;
if (a+b>c+d) {
cout << "Left" << endl;
}
else if (a+b==c+d) {
cout << "Balanced" << endl;
}
else {
cout << "Right" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s;
ll k;
cin >> s >> k;
int n = s.size();
ll ans = 0;
if (all_of(s.begin(), s.end(), [s](char x) { return x == s[0]; }))
ans = n * k / 2;
else {
... | 0 | 77,258,383 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
const double pi = acos(-1);
void koch(double x1, double y1, double x2, double y2, int n){
double tx1 = (2*x1 + x2) / 3.0;
double ty1 = (2*y1 + y2) / 3.0;
double tx2 = (x1 + 2*x2) / 3.0;
double ty2 = (y1 + 2*y2) / 3.0;
if(n > 0){
koch(x1... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
string t_str;
string h_str;
string taro[1009];
string hanako[1009];
int t_score=0;
int h_score=0;
int i;
cin >> n;
for(i=0;i<n;i++){
cin >> t_str >> h_str;
transform(t_str.begin(),t_str.end(),t_st... | 0 | 97,235,384 |
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define LLIandI pair<long ... | #include <iostream>
#include <string>
using namespace std;
bool isAC(const string &S) {
if (S[0] != 'A') return false;
int cnum = 0;
bool exist = false;
for (int i = 1; i < S.size(); ++i) {
if (i >= 2 && i + 1 < S.size() && S[i] == 'C') ++cnum;
if (S[i] >= 'A' && S[i] <= 'Z' && S[i] !=... | 0 | 2,024,740 |
#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
int main(){
bool F=true;bool R=true;
while(1){char str[250]={},ch;
for(int i=0;i<245;i++)
{scanf("%c",&ch);if(ch=='.'&&R==false&&i==1){F=false;break;}
if(ch=='.'){break;}
str[i]=ch;}
if(F==false){break;}
int ks=0,kl=0,ms=0,ml=0;
bool f=t... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <stdlib.h>
#include <set>
typedef long long ll;
using namespace std;
int main() {
int a,b,c,... | 0 | 34,669,945 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <string>
using namespace std;
int main(){
double x1, y1, x2, y2, out;
cin >> x1 >> y1 >> x2 >> y2;
out = sqrt(pow(x2-x1, 2.0)+pow(y2-y1, 2.0));
cout << fixed << setprecision(10) << out << endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define MAX 200000
typedef long long ll;
int main()
{
ll x,sum[MAX],tot,MIN;
int n;
scanf("%d",&n);
sum[0]=0;
for(int i=1;i<=n;i++)
{
scanf("%lld",&x);
sum[i]=sum[i-1]+x;
... | 0 | 87,299,905 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
char a, b; cin >> a >> b;
if(a == b) cout << "H" << '\n';
else cout << "D" << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int vis[200005];
int main()
{
int n,m,i,j,a[200005];
memset(vis,0,sizeof(vis));
cin>>n;
int cnt=1;
while(1)
{
if(vis[n]==1)
{
cout<<cnt<<endl;
break;
}
else vis[n]=1;
if(n%2==0)
{... | 0 | 48,209,459 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
int ans=0;
for(int i=0;i<n && k--;i++) {
ans+=a[i];
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
while(true){
int n,m,p;
scanf("%d%d%d",&n,&m,&p);
if(n+m+p==0)return 0;
int sum = 0;
int win = 0;
for(int i=0;i<n;i++){
int x;
scanf("%d",&x);
sum += x;
if(i==m-1)win = x;
}
sum *= 100;
p = 100 - p;
... | 0 | 72,894,430 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
int r, s, p;
string T;
map<int, bool> win;
ll ans;
ans = 0;
cin >> n >> k;
cin >> r >> s >> p;
cin >> T;
for (int i = 1; i <= T.size(); i++){
char te;
te = T[i-1];
if (k < i && te == T[i-1-k]) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i ... | 0 | 45,690,124 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=998244353;
const ll MAX=91... | #include<bits/stdc++.h>
#include<string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <stdlib.h>
#include<string>
#define mp make_pair
#define ss second
#define ff first
#define pb push_back
#define io ios_base::sync_with_stdio;cin.tie(0);cout.tie(0)
#define READ freopen("input... | 0 | 27,044,733 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char A[100];
cin>>A;
int n=strlen(A)/2;
int i;
for(i=0;i<n;i++){
if(A[i]!=A[n+1+i]){printf("No");return 0;}
}
int s=n/2;
for(i=0;i<s;i++){
if(A[i]!=A[n-1-i]){printf("No");return 0;}
}
printf("Yes\n");
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string a, b;
cin >> a >> b;
int ans = 1e9;
int n = a.size();
int m = b.size();
for (int i = 0; i < n - m + 1; i++)
{
int cnt = 0;
... | 0 | 17,528,649 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define int long long
#define endl "\n"
#define fi first
#define se second
#define fastio ios_base... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend(... | 0 | 27,666,811 |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
while (1) {
int h, w;
cin >> h >> w;
if (h == 0 && w == 0) {
break;
}
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
printf("#");
}
printf("\n");
}
printf("\n");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; 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 | 1,345,550 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, T;
cin >> N >> T;
vector<ll> time(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> time[i];
}
for (int i = 0; i < N-1; i++) {
if (time[i+1] - time[i] < T) {
ans += time[i+1]- time[i];
} else {
... | #include<iostream>
#include<string>
#include<vector>
using namespace std;
short ss[90061];
short ee[90061];
int ans[10000];
int c = 0;
int ch2int(char c){
return (int)c - (int)'0';
}
int st2int(string s){
return (ch2int(s[0]) * 10 + ch2int(s[1])) * 3600 + (ch2int(s[3]) * 10 + ch2int(s[4])) * 60 + ch2int(s[6]) *... | 0 | 51,453,643 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1LL << 30;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int cnt= 0;
REP(i,s.size()) if(s[i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int i;
int ch = 0;
string t = "YAKI";
if(s.size() < 4)
{
ch = 1;
}
if(ch == 0)
{
for(i = 0; i < 4; i++)
{
if(s.at(i) != t.at(i))
{
ch = 1;
break;
}
}
}
if(ch == 0)
{
... | 0 | 54,050,308 |
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
ll k;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_bac... | 0 | 91,774,514 |
#include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define print(s) cout << s << endl; return 0;
#define printFix(n,i) cout << fixed << setprecision(i) << n << endl; return 0;
#define yes cout << "Yes" << endl; return 0;
#define no cout << "No" << endl; return 0;
#define rep(i,n) for (in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int cal(string x, string y)
{
int n1 = x.size(), n2 = y.size();
vector<vector<int> > dp(n1 + 5, vector<int>(n2 + 5, 0));
for (int i = 0; i < n1; ++i) {
for (int j = 0; j < n2; ++j) {
if (x[i] == y[j]) {
dp[i... | 0 | 85,164,107 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main() {
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll ans = b-a+1;
ll e = c/gcd(c,d)*d;
ans -= b/c-(a-1)/c+b/d-(a-1)/d-(b/e-(a-1)/e);
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <functional>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(i... | 0 | 88,701,549 |
#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
int n,a,f;
int t[N],maxn=-N;
void hs(int x){
for(int i=2;i<=sqrt(x);){
if(x%i==0){
t[i]++;
while(x%i==0) x/=i;
}
else i++;
}
if(x>1) t[x]++;
}
int main(){
scanf("%d%d",&n,&a);
f=a;
fo... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 26,969,970 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef pair<int, int> P;
const long double EPS = 1e-10;
const long long INF = 1e18;
const int MOD = (int)1e9 + 7;
const long double PI = acos(-1.0L... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n), q(n), r(n);
for (int i = 0; i < n; i++) cin >> p[i];
for (int i = 0; i < n; i++) cin >> q[i];
iota (r.begin(), r.end(), 1);
bool pf = true, qf = true;
int a, b;
for (int i = 1; pf || qf; i++... | 0 | 59,909,252 |
#include <bits/stdc++.h>
using namespace std;
vector <long long> primeNumbers;
bool isPrime(long long n){
if(n==0)return false;
if(n==1)return false;
if(n==2)return true;
double sq = sqrt(n);
for(long long i = 2; i <= sq; i++){
if(n%i==0){
return false;
}
}
return... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A, B; cin >> A >> B;
vector<vector<char>> m(100, vector<char>(100));
for (int i = 0; i < 50; i++)
{
for (int j = 0; j < 100; j++)
{
if(j%2==0 && i%2==0 && B>1){
m[i][j] = '#';... | 0 | 78,919,857 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> a;
ll sum = 0;
a.push_back(0);
rep(i,n){
int c;
cin >> c;
a.push_back(c);
}
a.push_b... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 31,334,579 |
#include <iostream>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
char ca = a.at(0) - 0x20;
char cb = b.at(0) - 0x20;
char cc = c.at(0) - 0x20;
cout << ca << cb << cc << endl;
} | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int , int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s; ll k; cin >> s >> k;
ll cnt = 0;
int l = 0, r = 0;
int j = 0;
if(s[0] == s[s.size()-1]) {
++l;
... | 0 | 26,295,077 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main(){
int n, m;
std::cin >> n >> m;
std::vector<int> h(n);
for (int i = 0; i < n; i++)
{
std::cin >> h[i];
}
std::vector<int> obs(n);... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 1000010
vector<int> edge[MAXN];
int n,sg[MAXN],u,v;
void dfs(int u,int fa)
{
sg[u]=0;
for(auto v : edge[u])
{
if(v==fa)continue;
dfs(v,u);
sg[u]^=sg[v]+1;
}
}
int main()
{
scanf("%d",&n);
for(int i=1;i<n;++i)
... | 0 | 4,468,259 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int a, b;
cin >> a >> b ;
cout << a/b <<" " << a%b << " ";
printf("%9f", a*1.0/b*1.0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N, M;
cin >> N >> M;
Graph G(N);
for (int i = 0; i < M; ++i)
{
... | 0 | 45,819,447 |
#include <iostream>
int main(){
int n;
std::cin>>n;
std::cout<<(n-2)*180;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";string ret;static numeric_limits<TypeInt> t;TypeInt n = v;if ... | 0 | 100,451,092 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1010000000000000017LL;
const ll MOD = 1000000007LL;
#define REP(i, n) for(ll i = 0 ; i < n; i++)
#define DEBUG(fmt, ...) fprintf(stderr, fmt "\n", ##__VA_ARGS__)
int main(){
std::cout<<std::fixed<<std::setprecision(10);
ll X;
... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pa... | 0 | 58,314,761 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
using namespace std;
#define next '\n'
#define sp " "
#define print(x) cout << (x)
#define println(x) cout << (x) << next
#define stop return(0)... | 0 | 43,359,053 |
#include <iostream>
#include <iomanip>
using namespace std;
int main(void){
int n,t[102],v[102],m=0;
double w[50000],z=0;
cin>>n;
t[0]=0;
for(int i=1;i<=n;i++){
cin>>t[i];
t[i]+=t[i-1];
}
for(int i=1;i<=n;i++){
cin>>v[i];
}
m=t[n]*2;
int a=1;
w[0]=0;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define SORT(v) sort(ALL(v))
typedef pair<int, int> P;
int n, m, p;
int main()
{
while (cin >> n >> m >> p, n)
{
... | 0 | 88,551,304 |
#include<stdio.h>
int main(){
int a1,b1,c1,d1,a2,b2,c2,d2,sum1,sum2;
scanf("%d %d %d %d",&a1,&b1,&c1,&d1);
scanf("%d %d %d %d",&a2,&b2,&c2,&d2);
sum1=a1+b1+c1+d1;
sum2=a2+b2+c2+d2;
printf("%d\n",sum1<sum2?sum2:sum1);
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 18,606,789 |
#include <map>
#include <iostream>
struct range_valued_array {
using key_type = int;
using value_type = long long;
using iterator_type = std::map<key_type, value_type>::iterator;
std::map<key_type, value_type> mp;
key_type len;
range_valued_array(): len(0) {}
void resize_with(key_type new_len, const value... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;... | 0 | 83,210,828 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<double,double> P;
typedef long long ll;
int main(){
while(1){
int n, m; cin >> n >> m;
if(n == 0 && m == 0) return 0;
vect... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 1e6;
int unip[max_n],unir[max_n];
void init(int n){
for(int i=0 ; i<n ; i++){
unip[i] = i;
unir[i] = 0;
}
}
int find(int x){
if(unip[x] == x){
return x;
}else{
return unip[x] = find(unip[x]);
}
}
void unite(int x, int y){
x = fi... | 0 | 96,267,570 |
#include <iostream>
#include <string>
#include <climits>
#include <algorithm>
using namespace std;
const int MAX_N = 1010;
const int INF = INT_MAX;
int dp[MAX_N][MAX_N];
int main(void) {
string s1, s2; cin >> s1 >> s2;
fill_n((int *)dp, MAX_N*MAX_N, INF);
for (int i = 0; i <= s1.size(); i++) {
dp[0]... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=0;i<(n);++i)
#define rep3(i,a,b) for(ll i=(a);i<(b);++i)
#define rep4(i,a,b,c) for(l... | 0 | 3,861,981 |
#include <stdio.h>
int main(){
int index = 1;
int val = 0;
while (1){
scanf("%d", &val);
if (val == 0){
break;
}
printf("Case %d: %d\n", index, val);
index++;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4... | 0 | 62,682,214 |
#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 =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define _GLIBCXX_DEBUG
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_el... | 0 | 91,967,424 |
#include <iostream>
#include <string>
int main(void){
int A, B, ans=0;
std::cin >> A >> B;
for (int i=A; i<=B; ++i){
std::string S = std::to_string(i);
if (S.at(0) == S.at(4) && S.at(1) == S.at(3)) ++ans;
}
std::cout << ans << std::endl;
return 0;
} | #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 sp(n) cout << fixed << setprecision(n)
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... | 0 | 74,649,803 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <stack>
using namespace std;
int main() {
string s[5];
cin >> s[0] >> s[1] >> s[2];
if (s[0].back() == s[1][0] && s[1].back() == s[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec... | 0 | 84,062,153 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int l[100000], r[100000];
int sum = 0;
cin >> N;
for(int i=0; i<N; i++){
cin >> l[i] >> r[i];
if(l[i] != r[i]){
r[i]++;
sum += r[i] - l[i];
}
else if(l[i] == r[i]){
sum++;
}
}
cout << sum << endl;
} | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<queue>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
typedef pair<int, int> P;
int N;
string S;
string ans;
bool check() {
for (int i = 0; i... | 0 | 95,940,830 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,M;
cin>>N>>M;
priority_queue<ll> S;
for(ll i=0;i<N;i++) {
ll A;
cin>>A;
S.push(A);
}
for(ll i=0;i<M;i++) {
ll K=S.top()/2;
S.pop();
S.push(K);
}
ll ans=0;
while(!S.empty()) {
... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}... | 0 | 100,519,245 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using piii = pair<int, pair<int, int>>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
template <typename T>
using Graph = vector<vecto... | #include<bits/stdc++.h>
#ifdef _PRINTDEBUG
#include "lib/printdebug.hpp"
#else
#define printdebug(...) 1
#endif
#define MOD_1_000_000_007 (1000000007)
#define IINF (1<<28)
#define LINF (1LL<<60)
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n)... | 0 | 72,992,959 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
vector<int> d(K);
vector<vector<int>> A(K);
rep(i, K) {
cin >> d.at(i);
rep(... | #ifdef _WIN32
#pragma warning(disable:4996)
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <unordered_map>
#include <iostream>
using namespace std;
FILE* _fin = stdin;
FILE* _fout = stdout;
#define PI 3.14159265358979323846264338327950288419716939937510... | 0 | 53,619,382 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
int N,A,B; cin>>N>>A>>B;
int ct=0;
for(int i=1; i<=N; i++){
int num = i, sum=0;
while(num>0){
sum += num%10;
num /= 10;
}
if(A<=sum && sum<=B){
c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
int main(){
int n;
cin >> n;
vector<int> a(1e5);
for(int i=0; i<n; ++i){
int x;
cin >> x;
a[x]++;
}
int ans = 0;
ans = max(ans, a[0]+a[1]);
ans = max(ans, a[1e5]+a[1... | 0 | 40,061,603 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = 1; i <= n; i++){
double score = i;
double coin = 1.0/n;
while (score < k)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
#define F0R(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define sz (int)size
#define ub upper_bound
#define lb lower_bound
#define p... | 0 | 42,543,384 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int a[4];rep(i,4)cin>>a[i];
cout<<a[2]+(a[1]-a[3])<<" "<<a[3]+(a[2]-a[0])<<" "<<a[0]+(a[1]-a[3])<<" "<<a[1]+(a[2]-a[0])<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
inline void print() {
cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest) {
cout << first << ' ';
print(rest...);
}
void solve() {
int N; cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i... | 0 | 18,514,278 |
#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>
#include <random>
#define REP(i,m,n) for(int i=int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 3,696,051 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long s64;
inline int getint()
{
static char c;
while ((c = getchar()) < '0' || c > '9');
int res = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
res = res * 10 + c - '0';
return ... | #include<iostream>
#include<queue>
using namespace std;
static const int N = 100;
static const int INF = 100000000000;
int n, Adj[N][N];
int d[N];
void bfs(int s) {
queue<int> q;
q.push(s);
for (int i=0; i< n;i++)d[i] = INF;
d[s] = 0;
int u;
while (!q.empty()) {
u = q.front(); q.pop();
for(int v=0;v<n;v++){
... | 0 | 7,270,921 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#d... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int l = -1, r = -1;
for (int i = 0; i+2 <= n; i++) {
if (s[i] == s[i+1]) {
l = i+1, r = i+2;
break;
} else if (i+3 <= n && (s[i+1] == s[i+2] || s[i+2] == s[i])) {
... | 0 | 72,284,334 |
#include <bits/stdc++.h>
#define debug(s) cout << s << endl
#define debug1(s, t) cout << s << " " << t << endl
#define debug2(s, t, u) cout << s << " " << t << " " << u << endl
#define printvec(v) \
for (auto &&i : v) \
cout << i << " "; \
cout << endl
#define rep(n, i) for (int i = 0; i < n; i... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 34,757,189 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
int main() {
int N;
cin >> N;
string S, T;
cin >> S >> T;
int ans = 2 * N;
rep(i, N) {
if (S.substr(i) == T.substr(0, N-i)) {
... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int n , k , h[N] , f[N];
int main()
{
cin >> n >> k;
for(int i = 1 ; i <= n; ++i)
{
cin >> h[i];
f[i] = INT_MAX;
}
f[1] = 0;
for(int i = 2 ; i <= n; ++i)
{
for(int j = 1 ; j <= k; ++j)
{
... | 0 | 89,515,896 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int A, B, C, D;
cin >> A >> B >> C >> D;
auto ans = min(A, B) + min(C, D);
cout << ans << '\n';
return 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, K; cin >> N >> K;
if((N*(N-1)/2) - (N-1) < K){
cout << -1 << endl;
return 0;
}
int M = N*(N-1)/2 - K;
vector<P> edge;
rep... | 0 | 15,519,625 |
#include <algorithm>
#include <bitset>
#include <boost/rational.hpp>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(... | #include <algorithm>
#include <climits>
#include <cmath>
#include <csignal>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using Graph = std::vector<std::vector<int>>;
u... | 0 | 24,719,459 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void){
int a, b;
cin >> a >> b;
if (a == b){
cout << "Draw" << endl;
}else if (a == 1){
cout << "Alice" << endl;
}else... | #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>;
void solve() {
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(100001);
rep(i, n) {
int a, b;
cin >> a >> b;
jobs[a].push_back(b);
}
... | 0 | 60,391,090 |
#include <iostream>
using namespace std;
int main()
{
int n,r;
cin >> n >> r;
if (n >= 10){
cout << r;
}
else {
int x= r+(100*(10-n));
cout << x;
}
} | #include <iostream>
#include <iomanip>
#include <string>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
string s, t;
cin >> s >> t;
int n = s.size();
int m = t.size();
if (n < m)
{
... | 0 | 76,847,506 |
#include <iostream>
using namespace std;
class Triangle{
private:
int a, b, c;
public:
void Set();
bool Jugde();
};
void Triangle::Set(){
cin >> a >> b >> c;
}
bool Triangle::Jugde(){
int buf;
if(a < b){
buf = a;
a = b;
b = buf;
}
if(a < c){
buf = a;
a = c;
c = buf;
}
if(a*a == b*b + c*c) return t... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
string S; cin >> S;
bool j1 = true, j2 = false, j3 = true, j4 = false;
int cp = 0;
for (int i = 0; i < S.length(); ++i) {
if (i == 0 && S[i] != 'A') j1 = false;
if (2 <= i && i <... | 0 | 16,312,134 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int main(void)
{
int H, W;
while (1) {
scanf("%d %d", &H, &W);
if (H == 0 && W == 0)
break;
for (int i = 1; i <= H; i++) {
for (int j = 01; j <= W; j++) {
if ((i == 1 || i == H) || (j == 1 || j == W)) {
printf("#");
}
else
printf(".")... | #include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using pqg = priority_queue<ll,vector<ll>, greater<ll> >;
using pql = priority_queue<ll,vector<ll> >;
using pqg_p = priority_queue<P,... | 0 | 76,895,619 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const int N = 3e5+6;
const int mod = 1e9+7;
const int inf = 1e8;
int cnt[N];
void solve(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int x;
cin>>x;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using vvi = vector<vector<int>>;
const ll modSeed = pow(10,9) + 7;
const int INF = 1'000'000'000;
template <typename T>
vector<T> getVector(ll num){
... | 0 | 34,097,457 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
typedef double db;
const int oo=2139063143;
const int N=1010000;
const int P=1000000007;
const db eps=1e-7;
#define pritnf printf
templat... | 0 | 21,183,261 |
#include<bits/stdc++.h>
#define ld long double
#define ll long long
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define ppb pop_back
#define ull unsigned long long
#define over retu... | #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, p;
cin >> n >> p;
string s;
cin >> s;
if (10%p == 0) {
ll ans = 0;
rep(r,n) {
if ((s[r]-'0') % p == 0) {
... | 0 | 88,781,579 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
char a[100][100];
char b[100][100];
int main() {
int N,M;
cin>>N>>M;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
cin>>a[i][j];
}
}
for(int i=0;i<M;i++){
for(int j=0;j<M;j++){
cin>>b[i][j];
}
}
bool match=false;
for(int i=0;i<N... | 0 | 44,545,086 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N,K;
cin >> N >> K;
string S;
cin >> S;
vector<int> vec_0(0);
vector<int> v... | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj... | 0 | 55,021,740 |
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
int main(void){
int n,a,b;
while(cin>>n>>a>>b,n){
vi s(... | #include<bits/stdc++.h>
using namespace std;
int N, A, B;
int main(){
scanf("%d%d%d",&N,&A,&B);
if(A>N || B>N) return !printf("-1\n");
vector<int> v(N); for(int i=0;i<N;i++) v[i] = i+1;
vector<int> ret;
for(int i=0;i<A;i++){
ret.push_back(v.back());
v.pop_back();
}
reverse(re... | 0 | 10,441,212 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
const int INF = 1000100100;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int n; cin >> n;
int h[n];
rep(i,n)... | #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 mt make_tuple... | 0 | 70,776,772 |
#include <bits/stdc++.h>
using namespace std;
int f(string s) {
int ans = 0;
int counter = 0;
char cur = s[0];
for(int i = 0; i < s.size(); i++) {
if(s[i] == cur) {
counter++;
} else {
if(counter > 1) {
if(counter % 2 == 0) {
an... | #if 0
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int Q;
int L[1000+10][1000+10];
int main() {
cin >> Q;
string X, Y;
for (int i = 0; i < Q; i++) {
for (int j = 0; j < 1000+10; j++) {
L[0][j] = 0; L[j][0] = 0;
}
cin >> X >> Y;
for (int x = 1; x <= X.length(... | 0 | 86,271,454 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=(n);i++)
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9+7;
int main(){
int n;
cin>>n;
int ans=n;
for(int i=0;i<=n;i++){
int now=0;
int t=i;
while(t>0){
now+=t%6;
t... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
void so... | 0 | 46,582,848 |
#include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s, t;
cin >> s >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=1LL<<60;
const double EPS = 1e-10;
const ll mod=1000000007;
int main(void){
ll a,b;
cin>>a>>b;
if(b-a+1>=2019) cout<<0<<endl;
else{
ll ans=INF;
for(ll i=a;i<=b-1;i++){
for(ll j=i+1;j<=b;j++){
... | 0 | 39,546,952 |
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
long long POW(long long x, long long n) {
if (n == 0) return 1;
if (n % 2 == 1) return (x * POW(x, n - 1));
long long t = POW(x, n / 2);
return (t * t);
}
int main() {
int N, K;
cin >> N >> K;
... | #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( void )
{
char a,b;
cin >> a >> b;
int ans = 1;
if ( a == 'D' )
ans *= -1;
if ( b == 'D' )
ans *= -1;
if ( ans > 0 )
cout << 'H' << endl;
... | 0 | 17,392,598 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (... | 0 | 88,782,746 |
#include <bits/stdc++.h>
#define INF 1e7
#define mod 1000000007
using namespace std;
typedef long long int ll;
typedef tuple<int,int,int> tii;
typedef tuple<long long int,long long int,long long int> tll;
typedef tuple<double,double,double> tdd;
int main()
{
ll a,b,c,d; cin >> a >> b >> c >> d;
ll ans = a*c;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
const int INF = 1<<29;
int main(){
int n, m; cin >> n >> m;
vector<int> a(m), b... | 0 | 57,191,014 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int h,w,d,t1,t2;
int main(){
cin>>h>>w>>d;
for(int i=1;i<=h;++i,putchar(10))
for(int j=1;j<=w;++j){
t1=((i-j+w)/d)&1;
t2=((i+j)/d)&1;
putchar((t1<<1|t2)["RYGB"]);
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | 0 | 10,154,348 |
#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=1e5+5;
int h,s[maxn];
int parent(int i)
{
return i/2;
}
int left(int i)
{
return i*2;
}
int right(int i)
{
return i*2+1;
}
int main()
{
scanf("%d",&h);
for(int i=1;i<=h;i++){
scanf("%d",&s[i]);
}
for(int i=1;i<=h... | #include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#define ll long long
#define inf 20021225
#define N 1225
using namespace std;
int read()
{
int s=0,t=1; char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') t=-1; ch=getchar();}
while(ch>='0' && ch<='9') s=s*10+ch-'0',ch=getchar();
return s*t;
}... | 0 | 4,459,554 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a,b,c,d;
d=N%10;
c=(N-d)%100/10;
b=(N-d-c*10)%1000/100;
a=(N-d-c*10-b*100)%10000/1000;
if(((a==b)&&(b==c))||((b==c)&&(c==d))){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<bitset>
#include<numeric>
using namespace std;
int main(){
int N,M;cin>>N>>M;
long x[N],y[N],z[N],ans=0L;
vector<long>v(N);
for(int i=0;i<N;i++)cin>>x[i]>>y[i]>>z[i];
for(int bit=0;bit<8;bit++){
bitset<3>b(bit);
for(int... | 0 | 97,594,817 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int x;
cin >> x;
cout << ((x / 100)*5 >= (x... | #include <iostream>
#include <cstring>
#include <stack>
#include <algorithm>
using namespace std;
int N,A[100005],L[100005];
int main()
{
L[0]=0;
cin>>N;
int i,j;
for(i=1;i<=N;i++){
cin>>A[i];
}
int len=1;
L[0]=A[1];
for(i=1;i<=N;i++){
if(L[len-1]<A[i])L[len++]=A[i];
... | 0 | 20,630,124 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>... | #include <iostream>
int main(int argc, const char *argv[]) {
std::string str;
int m, h;
for ( ; std::cin >> str && str != "-"; ) {
std::cin >> m;
for (int i = 0; i < m; i++) {
std::cin >> h;
str = str.substr(h) + str.substr(0, h);
}
std::cout << str <<... | 0 | 41,665,810 |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<math.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
int main()
{
ll S[2005]={0,0,0,1,1};
int s;
cin>>s;
for(int i=4;i<... | #include<iostream>
using namespace std;
int main()
{
int H, W, A, B; cin >> H >> W >> A >> B;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(j < A){
if(i < B) cout << 1;
else cout << 0;
}else{
if(i < B) cout << 0;
... | 0 | 54,149,864 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.