code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define MAX 1000
string s,t;
int dp[MAX+1][MAX+1];
int d(int i,int j){
if(s[i]==t[j]) return 0;
else return 1;
}
int main(){
cin>>s>>t;
for(int i=0;i<=s.size();++i) for(int j=0;j<=t.size();++j){
if(i==0||j==0){
dp[i][j]=max(i,j);
continue;
}
dp[i][j]=min(min... | #include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | 0 | 86,688,286 |
#include <algorithm>
#include <cstdio>
#include <climits>
#include <vector>
using namespace std;
int chid(char ch) {int ret = ch; if(ret<=0) ret+=256; return ret;}
int main() {
while(true) {
int n; scanf("%d\n", &n);
if(n==0) break;
static char transl[256];
for(int i = 0; i < 256; i+... | #include<iostream>
#include<cstdio>
#include<cstring>
#define Nil -1
#define maxn 100005
using namespace std;
int n,root;
int dep[maxn];
struct node
{
int parent;
int left_son;
int right_brother;
node():parent(Nil),left_son(Nil),right_brother(Nil) {}
};
node t[maxn];
void build()
{
for(int i=0; i<n... | 0 | 34,603,419 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <list>
using namespace std;
static const int MAX=100000;
vector<int> G[MAX];
list<int> result;
int n;
int indeg[MAX];
bool Visited[MAX];
void bfs(int s)
{
queue<int> Q;
Q.push(s);
Visited[s]=true;
while(!Q.empty())
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int count = 0;
for(int i = 1;i <= n;i++){
count += i;
if(count >= n){
for(int j = 1;j <= i;j++){
if(count - n != j && j != i){
cout << j << " ";
}else if(j == i){
cout << j;
}
... | 0 | 75,349,024 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#defi... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
string s,t;
cin >> s >> t;
if(s.size() < t.size()){
cout << "UNRESTORABLE" <... | 0 | 61,579,531 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
const int MAXn = 1e7+8;
int main(){
int n, m ,x;
cin >> n >> m >> x;
vector<int> c(n+1);
vector<int> a[n+1];
int tmp;
for(int i = 0; i<n; i++){
cin >> c[i];
for(int j = 0; j<m; j++){
cin >> tmp;
a[i].push_back(tmp);
}
}
int mcost = MAXn... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 0 | 38,887,279 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
void solve(){
int n,m;
cin>>n>>m;
vector<int>sw[n+1];
for(int i=0;i<m;i++){
int s;
c... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<... | 0 | 42,254,327 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int N, M;
int main()
{
ios_base::sync_with_stdio(0);
cin >> N >> M;
ll nsum = 0, nans = 0;
for (int i = 0; i < N; i++)
{
ll x;
cin >> x;
nans += (x * i - nsum);
nans %= MOD;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int N;
cin>>N;
int A[100000];
for(int i=0;i<=N;i++){
cin>>A[i];
}
int maxnode[N+1];
int minnode[N+1];
minnode[N]=A[N];
maxnode[N]=A[N];
for(int i=N;i>0;i--){
minnode[i-1]=(minnode[i]+1)/2+A[i-1];
maxnode[i... | 0 | 8,742,832 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
const int INF = 1000000001;
int main(){
string a, b, c;
cin >>a >> b>>c;
printf("%c%c%c\n",toupper(a.at(0)),toupper(b.at(... | #include<bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#pragma GCC optimize "trapv"
#define _GLIBCXX_DEBUG
#define ll long long int
#define ld long double
#define ull unsigned long long int
#define rep(i,a,n) for (ll i=a;i<n;i++)
#define per(i,a,n) fo... | 0 | 6,437,527 |
#include <iostream>
int main() {
long x[2], y[2];
for(int i = 0; i < 2; ++i) {
std::cin >> x[i];
}
for(int i = 0; i < 2; ++i) {
std::cin >> y[i];
}
long long p = -1e18;
for(int i = 0; i < 2; ++i) {
for(int j = 0; j < 2; ++j) {
if(x[i] * y[j] > p) {
... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 81,770,154 |
#include <iostream>
#include <cstdio>
#include <bitset>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
using namespace std;
#define ll long long
#define vec vector
#define vecll vector<long long>
#define vec2ll vector<vector<long long>>
#define forll(s,a,b)... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
vector<long long> divisors(long long a){
vector<long long> res;
for(long long i=1;i*i<=a;i++) if(a%i==0) {
res.emplace_back(i);
if(i*i<a) res.emplace_back(a/i);
}
sort(res.begin(),res.end());
return res;... | 0 | 46,069,480 |
#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() {
double n;
cin >> n;
vector<int> a(n);
double bunsi = 1;
double bunbo = 0;
rep(i, n) cin >> a[i];
rep(i, n) {
double tmp = 1;
... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 17,323,949 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=9999999999999999;
int main() {
int N;
cin>>N;
vector<int>W(N);int sum=0;
for(int i=0;i<N;i++){
cin>>W[i];sum+=W[i];
}
int left=0;int right=0;int ans=999999;
for(int i=0;i<N;i++){
left+=W[i];right=sum-left;
ans=min(abs(left-right),ans);
}
... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 63,059,736 |
#include <iostream>
#include <cstdio>
int main()
{
int i=0,num;
char str[1200],c='a';
while(c!='\n'){
scanf("%c",&c);
str[i]=c;
i++;
}
num=i;
for(i=0;i<num;i++){
if(97<=str[i]&&str[i]<=122){
str[i]=str[i]-32;
}else if(65<=str[i]&&str[i]<=90){
str[i]=str[i]+32;
}
}
i=-1;
while(str[i++]!='\n'){... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s, t;
int c = 0;
cin>>s>>t;
for(int x = 0; x < s.length(); x++){
if(s[x] != t[x])
++c;
}
cout<<c<<endl;
return 0;
} | 0 | 75,380,644 |
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define ll long long
#define f(i, n) for (int i = 0; i < n; i++)
#define ff(i, n) for (int i = 1; i <= n; i++)
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n+1),b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin ... | 0 | 27,704,868 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
typedef struct st
{
double x;
double y;
}st_Coordinate;
int n;
void Koch_curve(st_Coordinate p1, st_Coordinate p2, int n);
int main(void)
{
st_Coordinate st_start,... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
typedef long long int ll;
const int E_MAX = 102;
const int K_MAX = 4;
string n;
int k;
ll Choice(int l, int t){
if (t < 0)return 0;
ll ans = 1;
for(int i = 0; i < t; i++)ans *= (l-i);
for(int j = 1; j <= t; j++... | 0 | 6,201,657 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf (ll)(1e18)
#define mod 1000000007
int main()
{
int t=1;
while( t-- )
{
string s1,s2;
cin>>s1>>s2;
bool flag=1;
for( int i=0 ; i<s1.size() ; i++ )
if( s1[i]!=s2[i] )
{
... | 0 | 51,457,618 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ld a,b,x;
... | #include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j;
int main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>a;
for(i=1; ; i++){
if((a*i)%360==0){
cout<<i;
return 0;
}
}
return 0;
} | 0 | 33,094,874 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int r,D,x;
cin>>r>>D>>x;
long long int x_tmp=r*x-D;
for(int i=1;i<=10;i++){
cout<<x_tmp<<endl;
x_tmp=r*x_tmp-D;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100006;
const int MOD = 1e9 + 7;
int occ[N];
int F[N], I[N];
ll pow1(ll n, ll p){
ll c, r;
c = n;
r = 1;
while(p){
if(p & 1)
(r *= c) %= MOD;
p /= 2;
(c *= c) %= MOD;
}
return r;
}
void init(){
F[0] = I[0] ... | 0 | 61,227,947 |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define it(a, x) for (auto &a : x)
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpii vector<pii>
#define vs vector... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 0 | 87,286,409 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
map<int,int> mp;
int MAX = 0;
int MIN = 1e9;
for(int i=0; i<N; i++){
int x;
cin >> x;
mp[x]++;
MAX = max(MAX,x);
MIN = min(MIN,x);
}
bool flag = true;
int now = MIN-1;
for(auto itr = mp.begin(); itr != mp.e... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int checkMove(int time, int x, int y){
if(time == 0){
if(x == 0 && y == 0) return 0;
else return -1;
}
if(x == 0 && y == 0){
if(time % 2 == 0) return 0;
else return -1;
}
int rc = -1;
if(x > 0){
rc = checkMove(ti... | 0 | 29,986,188 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string a,b;
cin >> a >> b;
int len=0;
for(int i=0;i<n;i++){
bool ok=true;
for(int j=0;j<n-i;j++)
if(a.at(i+j)!=b.at(j))
ok=false;
if(ok)
len=max(n-i,len);
}
cout << n*2-len << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5+15,M = 2e5+5;
bool vis[N];
ll dp[N];
vector<pair<int,int> >adj[N];
void dfs(int node) {
vis[node] = true;
for(int i=0;i<adj[node].size();++i) {
int nextNode = adj[node][i].first , ww = adj[node][i].second;
if(!v... | 0 | 91,655,798 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,LL> PL;
const int MOD=1000000007;
int INF=100100100;
int main(){
LL n;cin>>n;
cout<<n*(n-1)/2<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int N=S.size();
int count1=0,count2=0;
for(int i=0;i<N;i++){
if(i%2==0 && S.at(i)=='0'){
count1++;
}
else if(i%2==1 && S.at(i)=='1'){
count1++;
}
if(i%2==0 && S.at(i)=='1'){
count2++;
}
e... | 0 | 44,276,185 |
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
string S;
cin >> S;
string subS;
string leftS, rightS;
int maxLength = 1;
for (int i = 1; i < S.size() - 1; i++)
{
subS = S;
for (in... | 0 | 12,427,940 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int n,i,j,k,l;
cin>>n;
int a[n+1];
for(i=1;i<=n;i++) cin>>a[i];
int dp[n+1];dp[n]=0;
for(i=n-1;i>=1;i--)
{
if(a[i]>=a[i+1])
dp[i]=dp[i+1]+1;
else
dp[i]=0;
}
int min1=0;
for(i=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define pb push_back
#define ALL(v) v.begin(),v.end()
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool ... | 0 | 50,838,423 |
#include <iostream>
#include <ccomplex>
#include <vector>
#include <cassert>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
#include <list>
#include <assert.h>
#include <math.h>
#incl... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
vector<string> T={"dream","dreamer","erase","eraser"};
reverse(S.begin(),S.end());
for(int i=0;i<4;i++){
reverse(T.at(i).begin(),T.at(i).end());
}
bool all_cut=true;
for(int i=0;i<S.size();){
bool cut=false;
for(in... | 0 | 83,519,760 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
int main() {
ll n,m; cin>>n>>m;
vector<ll> v(n);
ll sum=0;
rep(i,n){
cin>>v[i];
sum+=v[i];
}
vector<ll> vec;
rep(i,n){
while(v[i]>0){
vec.pu... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 46,253,570 |
#include <cstdio>
#include <algorithm>
using namespace std;
int a[5];
int main(){
for (int i = 0; i < 5; i++) {
scanf("%d", &a[i]);
}
sort(a, a + 5);
for (int i = 4; i >= 0; i--) {
if (i == 0) {
printf("%d\n", a[i]);
}
else {
printf("%d ", a[i]);
}
}
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
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;}
int ... | 0 | 1,472,242 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
#define INF 1e15
int qe,k;
vector<pair<ll,ll> > adj[100005];
vector<ll> dist(100005, INF);
void shortestPath()
{
priority_queue< pair<ll,ll>, vector <pair<ll,ll>> , greater<pair<ll,ll>> > pq;
pq.push(make_pair(0, k));
dist[k] = 0;
w... | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
using namespace std;
int main()
{
int n, s[101];
while (cin >>n &&n> 0) {
int mean = 0;
for (int i = 0; i < n; i++) cin >> s[i];
sort(s,s+n);
for (int t =... | 0 | 62,981,466 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define all(a) a.begin(), a.end()
#define sz(a) a.size()
#define pb push_back
using namespace std;
const ll mod = 1e9+7;
ll n, d[10000001], ans=0;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("A.txt", "r",... | 0 | 22,327,074 |
#include <iostream>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int ev = n*(n-1) / 2;
int od = m*(m-1) / 2;
int ans = ev + od;
cout << ans << endl;
} | #include<iostream>
using namespace std;
int main(){
int n,x,i,j,k;
int a=0;
while(1){
cin>>n>>x;
if (n==0 && x==0) break;
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){
if(j<=i)continue;
for(k=j+1;k<=n;k++){
if(k<=j ||k<=i)cont... | 0 | 46,217,851 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <limits>
#include <functional>
using namespace std;
int main()
{
int N,X;
cin >> N;
int f = 0;
int ans = 0, amari;
X = N;
while (N != 0)
{
amari = N % 10;
f += amari;
... | #include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
int max,count;
max=0;
count=0;
for(int i=0; i<s.length();i++){
if(s[i]=='R'){
count++;
if(max<count){
max=count;
}
}
else
count=0;
}
cout<<max;
} | 0 | 74,000,616 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define in insert
#define pi 2*acos(0.0)1
#define srt(s) sort(s.begin(),s.end())
#define all(x) x.begin(),x.end()
const ll mod=1e9+7;
const ll MX=2e5... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int N;
long long int mod = 1e9+7;
cin >> N;
string s;
cin >> s;
if(s[0] == 'W'||s[2*N-1]=='W'){
cout << 0 << endl;
}
else{
long long int l=1,r=0;
long long int sum = 1;
char a = 'L';
for(int i = 1; i < 2*N; i++){
... | 0 | 2,488,719 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using P=pair<long long,long long>;
#define rep(i,n) ... | 0 | 95,604,769 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#include<functional>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n)... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define re... | 0 | 29,291,356 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pli pair<ll,int>
#define mp make_pair
#define fst first
#define snd second
const int maxn=1e5+7;
int n;
ll d[maxn];
pli sx[maxn];
int sz[maxn];
ll dis[maxn];
int findit(ll t){
if (t<0) return -1;
int l=0,r=n-1,mid;
wh... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i... | 0 | 36,473,513 |
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using l... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll s,c;
cin >> s >> c;
if(s >= c){
cout << c / 2 << endl;
return 0;
}
else
{
ll sum = s;
c -= s * 2;
sum += c / 4;
cout << sum << endl;
}
} | 0 | 35,686,716 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int A,B,i,count=0,len,n;
string temp,temp2;
cin>>A>>B;
for(i=A; i<=B; i++)
{
temp=to_string(i);
temp2=temp;
len=temp2.length();
n=len-1;
for(int i=0; i<(len/2); i++)
{
swap(temp2[i],... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | 0 | 88,604,186 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b; cin >> a >> b;
if(a+b == 3)
cout << 3 << endl;
else if(a+b == 4)
cout << 2 << endl;
else if(a+b == 5)
cout << 1 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
using namespace std;
int main() {
string s, right = "yuiopjhklnm";
int count;
bool use_right;
while (cin >> s, s != "#") {
count = 0;
... | 0 | 7,029,839 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | 0 | 25,719,005 |
#include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
int main(){
string st1,st2;
int n;
cin>>n;
for(int iii=0;iii<n;iii++){
cin>>st1>>st2;
int d=1,a=0,s1=0,s2=0;
int S=0;
for(int i=0;i<st1.size();i++){
if(st1[i]=='m'){s1+=d*1000;d=1;}
else if(st1[i]=='c'){s1+=d*100;d=1;}
else if(st1[i]=='x'){s1+=d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
ll N,K;
cin>>N>>K;
vector<pair<ll,ll>>A(N);
rep(i,N){
cin>>A[i].first;
ci... | 0 | 44,009,436 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll ch[3][3];
for(ll i=0;i<3;i++){
for(ll j=0;j<3;j++){
cin>>ch[i][j];
}
}
ll n;
cin>>n;
map<ll,ll>q;
for(ll j=0;j<n;j++){
ll now;
cin>>now;
q[now]++;
}
for(ll i=0;i<3;i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 0 | 85,318,735 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, clas... | #include <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <utility>
using namespace std;
typedef pair<int,int> pii;
int main(void){
int N,M;
int a,b;
std::priority_queue<pii,vector<pii>,less<pii> > root;
while(cin>>N>>M,N||M){
for(int i=0;i<N;i++){
cin>>a>>b;
root.push(std::make... | 0 | 97,169,479 |
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
int main(){
int n;cin>>n;
int keta=log10(n);
int count =0;
for(int i=1;i<=keta+1;i++){
if(i%2==1){
if(i==keta+1) count+=n-pow(10,keta)+1;
else count += pow(10,i)-pow(10,i-1);
}
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 100,404,875 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
long long a,b,c,f;
cin>>a>>b>>c;
f=a;
vector <long long> d(b,0);
while(d[f%b]==0){
d[f%b]++;
f+=a;
}
if(d[c]==0){
cout<<"NO"<<endl;
... | 0 | 1,523,631 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using P = pair<int,int>;
using ll = long long;
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n) {
rep(i, n... | #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 ALL(n) begin(n),end(n)
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
typedef pair<int, int> pint;
struct cww{... | 0 | 74,096,242 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> c(n), d(n + 1);
for (int i = 0; i < n; i++) {
int a;
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S,T;
cin >> S >> T;
if(S == T){
cout << "No" << endl;
return 0;
}
int X = S.size(),Y = T.size();
vector<char>a(X),b(Y);
for(int i=0; i<X; i++){
a[i] = S[i];
}
for(int i=0; i<Y; i++){
b[i] = T[i];
}
sort(a.begin(),a.e... | 0 | 44,685,456 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<n*n<<"\n";
} | #include <bits/stdc++.h>
#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++)
using namespace std;
int main() {
string s;
cin>>s;
int n=s.size();
if(s.at(0)=='k'&&s.at(1)=='e'&&s.at(2)=='y'&&s.at(3)=='e'&&s.at(4)=='n'&&s.at(5)=='c'&&s.at(6)=='e'){
co... | 0 | 95,811,270 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N), b(N), c(M), d(M);
for(int i=0; i<N; i++) {
cin >> a[i] >> b[i];
}
for(int j=0; j<M; j++) {
cin >> c[j] >> d[j];
}
for(int i=0; i<N; i++) {
int min_d = abs... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | 0 | 37,923,416 |
#include<stdio.h>
int main()
{
int a,b,c,d,e,f,g,h,s,t;
scanf("%d%d%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f,&g,&h);
s=a+b+c+d;
t=e+f+g+h;
if(s>t){
printf("%d\n",s);
}else{
printf("%d\n",t);
}
return 0;
} | #include <iostream>
#include<string>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
int n = s.size() - k ;
if (k < s.size()) {
for (int i = 0; i<n; i++)
s.pop_back();
cout << s << "...";
}
else
cout << s;
} | 0 | 67,097,344 |
#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>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
const int MAX_N = 11;
int main()
{
int n, m; cin >> n >> m;
vector<int> s[m];
... | #include <bits/stdc++.h>
#define int long long
const int INF = 1e18L + 5;
#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++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int mx = 2000000;
int c[mx];
in... | 0 | 79,952,527 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 58,805,648 |
#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 P, Q, R;
cin >> P >> Q >> R;
int ans = min(P + Q, min(Q + R, R + P));
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define per(i,n,j) for(int i=(n)-1;i>=(j);i--)
using ll=long long;
using namespace std;
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; re... | 0 | 43,910,464 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#de... | #include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <bitset>
#define repr... | 0 | 30,265,953 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> ... | 0 | 16,489,779 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
string s;
cin >> s;
int a = (s[0] - '0');
int b = (s[1] - '0... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#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 (1... | 0 | 54,399,395 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll int64_t
#define _GLIBCXX_DEBUG
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
ll s;
cin >> s;
ll x1=s/1000000000+1;
ll x2=x1*1000000000-s... | #include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
using namespace std;
int A[100000];
long long B[100000];
bool stand_bit(int N, int pos){
if((((N >> (... | 0 | 43,301,879 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;
int main(){
int N,L;
cin>>N>>L;
vector<int> a(N);
R... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 88,516,162 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define FORE(i, a, b) for(int i=(a);i<=(b);++i)
#define rep(i, n) for(int i=0;i<(n);++i)
#define repe(i, n) for(int i=0;i<=(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define SP cout<<fixed<<setprecision(... | #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 erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 0 | 48,737,850 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
int main(){
int n;
cin >> n;
vector<ll> t(n);
rep(i,n) cin >> t[i];
ll ans = t[0]... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 0 | 41,653,171 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
#define pb push_back
#define ppp pop_back
#define pii pair<int,int>
#define fi first
#define se second
#define stie std::tie
#define vec vector
#define forn(i, l, r) for (int i=l; i<=r; i++)
#define emp empty... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
... | 0 | 83,197,708 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
const ll MOD = 1e9 + 7;
const ll INF = 9e18;
const double eps = -1e10;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
#define ALL(x) (x).begin(),(x).end()
#define pb... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 41,808,264 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | #include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
vector<int> g[101010];
int color[101010];
int bipartite_graph(int v, int prev, int c) {
color[v] = c;
... | 0 | 78,856,690 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int h, w, n;
vector<vector<bool>> mp;
vector<pair<int,int>> f;
int calc(pair<int,int> start, pair<int,int> end){
vector<vector<int>> hi(w, vector<int>(h, 1145141919));
priority_queue<pair<int, pair<int,int>>, vector<pair<int, pair<int,int>>>,... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int,int> P;
const int INF=1e9;
int main(){
int h,w,ans=0;
cin>>h>>w;
vector<vector<char>> a(h,vector<char>(w));
vector<vector<int>> dist(h,vector<int>(w,INF));
queue<P> que;
rep(i,h) rep(j,w){
... | 0 | 15,431,840 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) res... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,m;
cin >> n >> m;
vector<pair<long long,long long>> v;
for(int i=0;i<n;i++){
long long a,b;
cin >> a >> b; v.push_back(make_pair(a,b));
}
sort(v.begin(),v.end());
long long purchaseNum = m;
... | 0 | 61,241,511 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <i... | #include <bits/stdc++.h>
#include <set>
#define ll long long
#include <string>
#define pb push_back
#define mp make_pair
# define pi 3.14159265358979323846
#define mod 1000000007
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
void fastio()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
... | 0 | 48,437,067 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using name... | #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define pi 3.141592653589... | 0 | 1,463,872 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int a,b,c;
cin >> a;
string s;
cin >> s;
b = s.at(0)-'0';
c = (s.at(2)-'0')*10 + s.at(3)-'0';
b = b*100+c;
long long int ans = (a*b)/100;
cout << ans << endl;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<tuple>
#include<ctime>
#include<functional>
#include<cmath>
#include<cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> p;
#define rep(i,... | 0 | 79,581,472 |
#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 int long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
const int MOD=1e9+7;
const int INF=1e15;
signed main(){
... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define pii pair<int, int>
#define All(x) (x).begin(), (x).end()
#define mp make_pair
#define Task "abc"
typedef long long ll;
const int maxn = 1e4 + 10;
const ll mod = 1e9 + 7;
int n, m;
int c[] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
int num[10], cost[1... | 0 | 79,991,279 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
char mozi;
cin>>mozi;
if(isupper(mozi)){
cout<<"A";
}else{
cout<<"a";
}
} | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
char maze[1001][1001];
int dis[1001][1001];
int main(void){
int H, W, N;
int sx, sy;
cin >> H >> W >> N;
rep(i, H) {
rep(j, W) {
... | 0 | 30,756,232 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,a,b,c;
cin >> x>>a;
b = x-a;
if(b<0)b=0;
cout <<b<<endl;
} | #pragma GCC optimize("O3")
#pragma GCC target("avx")
#include <bits/stdc++.h>
#define rep(i ,n) for(int i=0;i<(int)(n);++i)
#define repr(i ,n) for(int i=n;i>(int)(n);--i)
#define rep1(i ,n) for(int i=1;i<=(int)(n);++i)
#define ALL(a) a.begin(), a.end()
#define RSORT(a) sort(ALL(a),greater<>())
#define SORT(a) sort(ALL(... | 0 | 92,880,023 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b;
cin >> n >> a >> b;
if (n + 1 < a + b || a * b < n) {
cout << -1 << '\n';
ret... | 0 | 3,894,190 |
#include "bits/stdc++.h"
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))
#define min3(x, y, z) min(x, min(y, z))
#ifdef _MSC_FULL_VER
#define dout cout
#define debug() if (true)
#define check(x) std::cout << "★" <... | #include <bits/stdc++.h>
#define int long long
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define pb push_back
#define mp make_pair
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,a,b) for(int i=a;i<b;i++)
#define r... | 0 | 56,774,389 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
#define Fast_D cout<<fixed<<setprecision(13);
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define nl "\n"
#define int long long
#define double long... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <array>
using namespace std;
class dice {
int num_up;
int num_s;
int num_w;
int num_n;
int num_e;
int num_bot;
public:
dice()
{
... | 0 | 20,426,527 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x1,y1,x2,y2,x3,y3,x4,y4,dx,dy;
cin>>x1>>y1>>x2>>y2;
dx=x2-x1;
dy=y2-y1;
x3=x2-dy;
y3=y2+dx;
x4=x3-dx;
y4=y3-dy;
cout<<x3<<' '<<y3<<' '<<x4<<' '<<y4<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 0 | 77,358,331 |
#include <math.h>
#include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
const int INF = 10000000;
typedef pair<int, int> P;
int main() {
int H, W, N;
cin >> H >> W;
vector<vector<char>> field(H, vector<char>(W));
vector<vector<int>>... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
rep(i, n) cin >> a[i] >> b[i];
ll ... | 0 | 19,150,131 |
#include <bits/stdc++.h>
using namespace std;
class Cards {
public:
char m;
int n;
};
int main() {
int N;
cin >> N;
Cards b[N], s[N];
for (int i=0; i<N; i++) {
cin >> b[i].m >> b[i].n;
s[i]=b[i];
}
for (int i=0; i<N-1; i++) {
for (int j=N-1; j>i; j--) {
if (b[j].n<b[j-1].n) {
s... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 44,883,280 |
#include <iostream>
#include <fstream>
#include "bits/stdc++.h"
using namespace std;
#define int long long
class AApplePie {
public:
void solve(std::istream &in, std::ostream &out) {
int a, p;
in >> a >> p;
p += a * 3;
int ans = 0;
while (p >= 2) {
ans++;
p -= 2;
... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 38,564,866 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, ans;
int w, i = 0;
cin >> s >> w;
while(i < (int)s.size()) {
ans += s[i];
i += w;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int count(int x, int k){
int res = 0;
while(x < k){
x *= 2;
res++;
}
return res;
}
double pow(int x){
double res = 1.0;
for(int i = 0; i < x; i++){
res *= 0.5;
}
return res;
}
int main(){
int n, k;
cin >> n >> ... | 0 | 61,893,679 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 2e5+10;
int N, D, A;
pair<ll,ll> v[MAX_N];
ll damage[MAX_N];
void solve()
{
sort(v,v+N);
ll ans = 0;
for(int i=0;i<N;++i){
if(i>0) damage[i]+=damage[i-1];
if(damage[i]>=v[i].second) continue;
const ll b = 1LL*(v[i].second-dam... | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
double percent = 0.0... | 0 | 56,270,768 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define repm(i,n) for(int i=(i... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | 0 | 8,784,368 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
ll damage[1005];
ll cost[1005];
ll memo[1005][10005];
ll dp(int i, int h){
if (memo[i][h] != -1) return memo[i][h];
ll ans = 1'000'000'000;
if (damage[i] >= h) {ans = min(ans, cost[i]);}
else { ans = min(ans, cost[i] + dp(i, h-damage[i]));}
... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 6,271,906 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.1415926535897932384626433832795l
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
us... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M;
cin>>A>>B>>M;
vector<int> a(A,0);
vector<int> b(B,0);
vector<int> c(M,0);
vector<int> x(M,0);
vector<int> y(M,0);
int min_a;
int min_b;
int min_mix=INT_MAX;
for (size_t i = 0; i < A; i++)
{
cin>... | 0 | 5,965,001 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5005;
int n, k, a[maxn], dp[maxn][maxn];
bool check(int x) {
memset(dp, 0, sizeof dp);
if(x == 1) {
dp[2][0] = 1; dp[2][a[2]] = 1;
for (int i = 3; i <= n; ++i)
for (int j = 0; j <= k; ++j) {
dp[i][j] = dp[i - 1][j];
if(j >= a[i]) dp[i][j] ... | #include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
while (cin >> N >> M) {
vector<vector<int>> G(N);
for (int ... | 0 | 55,202,815 |
#include<stdio.h>
struct Card{
char suit;
char value;
};
void BubbleSort(struct Card *A, int length) {
int i, j;
char tmp;
char tmp1;
for(i = 0; i < length; i++) {
for(j = length-1; j > i; j--) {
if(A[j].value < A[j-1].value) {
tmp = A[j].value;
tmp1 = A[j].suit;
A[j].value = A[j-1].value;
A[j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
string S;
cin >> S;
int l=0;
int r=S.size()-1;
ll ans=0;
while(r-l>0){
if(S[l]==S[r]){
l++;
... | 0 | 7,279,685 |
#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>
using namespace std;
long long INF = (1LL<<62);
typedef long long L... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define RE... | 0 | 5,983,465 |
#include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
int main(){
int K;
cin >> K;
vector<int> A(K);
for (int i = 0; i < K; i++){
cin >> A[i];
}
long long tv1 = INF;
long long fv1 = 0;
while (tv1 - fv1 > 1){
long long mid = (tv1 + fv1) / 2;
long long N = mid;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD=1000000007;
int main() {
int N; cin>>N;
ll C,K; cin>>C>>K;
vector<ll> T(N,0);
for(int i=0;i<N;i++){
cin>>T[i];
}
sort(T.begin(),T.end());
ll ans=0;
ll count=0;
ll saisyo=0;
for(int i=0;i<N;i++)... | 0 | 76,305,408 |
#include <bits/stdc++.h>
using namespace std;
int H1, H2, M1, M2, K;
int main()
{
cin >> H1 >> M1 >> H2 >> M2 >> K;
M1 += H1 * 60;
M2 += H2 * 60;
int ans = M2 - M1 - K;
if (ans <= 0)
{
ans = 0;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
int N;
int M[256];
int toint(string s){
int res = 0;
for(int i=0;i<(int)s.size();i++){
if( s[i] >='2' && s[i] <= '9' ){
res += M[(int)s[i+1]] * (s[i]-'0');
i++;
} else {
res += M[(int)s[i]];
}
}
return res;
}
string ctos(char c){
strin... | 0 | 19,844,334 |
#include <iostream>
#include <vector>
#include <cstdlib>
using namespace std;
int main(void)
{
int i,j,num,diff;
while(1){
int min = 1000000;
cin >> num;
if(num == 0){
break;
}
vector<int> data(nu... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <map>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define INF 1e+18
int main() {
int v, e; cin >> v >> e;
vector<vector<ll>> d... | 0 | 14,236,448 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
const int mod = 1e9+7;
typedef long long LL;
typedef vector<int> vi; ... | #include<bits/stdc++.h>
using namespace std;
int main() {
int H, W; cin >> H >> W;
vector<vector<int>> grid(H, vector<int> (W, -1));
queue<pair<int, int>> black;
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
char c; cin >> c;
if(c == '#') {
grid.at(i).at(j) = 0;
black... | 0 | 99,717,856 |
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
getline(cin, s);
for(int i = 0 ; s[ i ] ; i++)
if(s[ i ] >= 65 && s[ i ] <= 90)
s[ i ] += 32;
else if(s[ i ] >= 97 && s[ i ] <= 122)
s[ i ] -= 32;
cout << s << en... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_YESN... | 0 | 93,682,019 |
#include <iostream>
#include<vector>
using namespace std;
#define rep(i,x) for(int i=1; i<=(x); i++)
int main(){
int n;
cin >> n;
int room[5][4][11];
rep(i,4) rep(j,3) rep(k,10) room[i][j][k] = 0;
rep(i,n){
int b,f,r,v;
cin >> b >> f >> r >> v;
room[b][f][r] += v;
}
rep(i,4){
rep(j,3){
... | #include <cstdio>
#include <algorithm>
#include <complex>
#include <utility>
using namespace std;
static const double EPS=1e-12;
static const double INF=1e24;
static const double PI=3.141592653589793;
using Point=complex<double>;
namespace std {
bool operator<(const Point &a, const Point &b) {
return real(a... | 0 | 100,531,636 |
#include <iostream>
#include <algorithm>
#include<vector>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int a, b, c, d = 0;
cin >> a >> b >> c;
for (int i = a; i < b+1; i++)
{
if (c % i == 0) d++;
}
cout << d << endl;
return 0;
} | #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>
#includ... | 0 | 2,829,691 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long int ll;
... | #include <cstdio>
typedef long long lld;
const int LOGN = 60;
const int MOD = 1e9+7;
int cnt[LOGN]{ };
lld A;
int N;
int main() {
scanf("%d", &N);
int ret = 0;
for (int i = 0; i < N; ++i) {
scanf("%lld", &A);
for (int j = 0; j < LOGN; ++j) {
int two = (1LL << j) % MOD;
int val;
if ((A >>... | 0 | 17,392,120 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,i,x,y,mx,a[1000010];
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d%d",&x,&y);
a[x]^=1;a[y]^=1;
}
for(i=1;i<=n;i++)if(a[i])return puts("NO"),0;
puts("YES");
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
int N,M,X;
cin >> N >> M >> X;
if(N==0||M==0||X==0){
cout << -1 << endl;
return 0;
}
vector<int> C(N);
vector<vector<int>> A(N,vector<int>(M));
long money=0;
long resul... | 0 | 48,352,009 |
#include <bits/stdc++.h>
using namespace std;
int main(){int A,B,C; cin>>A>>B>>C;for(int i=0;i<=A;i++)for(int j=0;j<=B;j++)if(i*(B-j)+j*(A-i)==C){cout<<"Yes"<<endl; return 0;}cout<<"No"<<endl;} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define F first
#define S second
#define SZ(a) (int)((a).size())
#define pb push_back
#define mp make_pair
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> PI;
typedef unsigned long long ull;
#defi... | 0 | 8,372,745 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#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 A, B;
cin >> A >> B;
if (max(100 * A, 80 * B) < min(80 * (B+1), 100 * (A+1... | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | 0 | 80,273,958 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
void _print(vector<int> res) {
for (int i = 1; i < res.size(); i++) {
cout << res[i] << " ";
}
cout << endl;
}
void maxHeap(vector<int> &heap, int i) {
int left = 2 * i;
int right = 2 * i + 1;
int lagest = i;
... | 0 | 11,914,139 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
... | 0 | 62,071,048 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string S;
cin >> S;
bool cond1 = (S[0] ... | #include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
while (1) {
if ((H == 0)&&(W == 0)) break;
for (int h = 1; h <= H; h++) {
for (int w = 1; w <= W; w++) {
cout << "#";
}
cout << endl;
}
cout << endl;
cin >> H >> W;
}
return 0;
} | 0 | 26,637,045 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define vi vector <int>
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define piii pair< int,pair<int,int> >
#define tiii tuple <int,int,int>
#define ff first
#define ss sec... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 21,303,107 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.