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;
typedef long long ll;
void solve(long long N, std::vector<long long> A)
{
sort(A.begin(), A.end());
if (A[0] == 0)
{
cout << 0 << endl;
return;
}
ll ans = 1;
for (ll i = 0; i < N; i++)
{
if (ans > (ll)1e18 / A[i])
... | #include <bits/stdc++.h>
using namespace std;
signed main(){
int X, N, i;
scanf("%d%d", &X, &N);
vector<int> p(N);
for(i = 0; i < N; i++){
scanf("%d", &p[i]);
}
int ans = 0;
for(int q = 0; q <= 101; q++){
int f = 1;
for(i = 0; i < N; i++){
if(q == p[i]){
f = 0;
}
}
if(f == 0){
continue;
... | 0 | 31,160,249 |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int x,a; cin>>x>>a;
if(x<a){
cout<<"0"<<endl;
}
else if(x>=a){
cout<<"10"<<endl;
}
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 0 | 34,885,056 |
#define _GLIBCXX_DEBUG
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<string>
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define rep2(i,s,n) fo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); ++ i)
#define rrp(i,a,b) for (int i = (a); i >= (b); -- i)
#define gc() getchar()
#define fir first
#define sec second
typedef pair<int,int> pii;
typedef long double db;
typedef long long ll;
template <typename tp>
inline void ... | 0 | 65,418,782 |
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 105
struct in{
char ch;
int val;
};
in a[maxn];
in b[maxn];
int n;
bool compareStable()
{
for(int i=0;i<n;i++)
{
if(a[i].ch!=b[i].ch)
return false;
}
return true;
}
void bubbleSort()
{
bool flag=1;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define ... | 0 | 99,064,866 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
int n, k;
int a[5000];
bool jdg[5000];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n, [](const int &i1, const int &i2)->bool {
return i1 > i2;
});
for (int i = 0; i... | 0 | 55,683,222 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int s;
cin >> s;
map<int,int>Map;
for(int i = 0; i < 1000000; i++) {
if(Map[s] > 0) {
cout << i+1 << endl;
return 0;
}
Map[s]++;
if(s%2 == 0) {
s/=2;
}
else {
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,Vmax;
cin >> N >> Vmax;
vector<int64_t> data(N);
int64_t buf;
for(int i=0; i<N; i++){
cin >> buf;
buf/= 2;
data.at(i)= buf;
}
int64_t cumlcd= 1;
int ord2= 0;
bool possible= true;
for(int i=0; i<N; i++){
int cnt= 0;
i... | 0 | 39,479,897 |
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
#include <utility>
using namespace std;
int size(string x){
string::size_type size=x.size();
return size;
}
#define fu(l,k) for(int i=l;i<k... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | 0 | 20,218,785 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 79,134,659 |
#include <iostream>
using namespace std;
int main(){
int a[10000],b[10000],c=0;
cin>>a[0]>>b[0];
while(a[c]!=0&&b[c]!=0){
cin>>a[c+1]>>b[c+1];
c++;
}
for(int d=0;d<c;d++){
for(int i=0;i<a[d];i++){
for(int j=0;j<b[d];j++){
cout<<'#';
}
cout<<endl;
}
cout<<endl;
}
return 0;
} | #include <iostream>
#include <limits>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) { for (auto it = c.begin(); it != c.end(); ... | 0 | 31,222,167 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | #include <bits/stdc++.h>
#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i <= _##i poi i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i < _##i poi i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i >= _##i p... | 0 | 15,827,882 |
#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>;
const int inf{int(1e9)};
int main(void){
int N;
cin >> N;
vector <int> A(N);
rep(i,N) cin >> A[i];
int ans = 0;
for (int i = 0; i < N... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#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 all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
int main() {
int... | 0 | 94,348,092 |
#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... | #include<iostream>
using namespace std;
int main() {
for (;;) {
int a,b;
cin >> a >> b;
if (a != 0 && b != 0) {
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
if (a == 0 && b == 0) {
break;
}
}
} | 0 | 85,185,216 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N; cin >> N;
vector<ll> a(N);
for (int i = 0; i... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
using namespace std;
#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)
typedef vector<int> vi;
int main()
{
int n;
while(sca... | 0 | 94,090,020 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(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<int,int>;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h+1);
rep(i, h) cin >> s[i];
rep(i, h) s[i] += '#';
s[h] = "";
rep(j, w+1) s[h] += '#';
vector<vector<int>> n... | 0 | 46,339,106 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll a, b, c;
cin>>a>>b;
c = pow(b-1, a-1);
if(a == 1)
{
cout<<b<<endl;
return 0;
}
else
{
cout<<c*b<<endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
if(n > m){
int tmp = n;
n = m;
m = tmp;
}
long long int ans = 0;
if(n == 1){
if(m == 1) ans = 1;
else if(m >= 3) ans = m-2;
}else if(n == 2){
ans = 0;
}else{
... | 0 | 97,920,105 |
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
int x,s;
cin>>x>>s;
int cnt=0;
for(int i=0; i<=x; i++)
{
for(int j=0; j<=x; j++)
{
int k=s-i-j;
if(k>=0 && k<=x) cnt++;
}
}
cout<<cnt;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
bool sortbysec(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.second<b.second);... | 0 | 80,560,855 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 1;
for (int i = 0; i < n; i++) {
long long a;
cin >> a;
if (a == 0) {
ans = 0;
cout << ans << endl;
return 0;
}
else if (a <= 1000000000... | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<cmath>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) s... | 0 | 47,405,281 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
ll topNum = 0;
ll linNum = 0;
ll ans = 0;
vector<vector<int>> line(n-1, vector<int>(2));... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | 0 | 83,599,674 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | #include <bits/stdc++.h>
using namespace std;
string s;
int k,m,n,x,y,z;
bool b=false;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]=='C'){
k++;m=i;
}}
y=s.size();
if(k==1 && s[0]=='A'&& m>=2 && m<=y-2){
for(int i=1;i<y;i++){
... | 0 | 70,127,760 |
#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 ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,ans=0; cin>>N;
vector<ll> A(N,0),B(N,0),D(N,0);
for(ll i=0; i<N; i++) cin>>A[i];
for(ll i=0; i<N; i++) cin>>B[i];
ll asum=0,bsum=0;
for(ll i=0; i<N; i++) asum+=A[i];
for(ll i=0; i<N; i++) bsum+=B[i];
ll p=asum-bsum;
if(... | 0 | 137,052 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define SORT(s) sor... | #include <iostream>
using namespace std;
static int a = 0;
void re(int n, int t) {
if(t == 0){
if(n == 0) {
a++;
return;
} else return;
}
for(int i = 0; i <= 9; i++) {
re(n - i, t - 1);
}
return;
}
int main() {
int n;
while(cin >> n) {
... | 0 | 66,821,649 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#define rep(i, a, b) for (ll i = a; i < (ll)b; ++i)
#de... | #include<iostream>
using namespace std;
#include<cmath>
#include<math.h>
int main() {
double a, b, angle, rad, h, area, c, pi;
cin >> a >> b >> angle;
rad = angle * (M_PI / 180);
h = b*sin(rad);
c = sqrt(pow(a, 2) + pow(b, 2) - 2 * a * b * cos(rad));
area = ((a * b) / 2) ... | 0 | 72,292,427 |
#include <stdio.h>
int main ()
{
int box [3][3], n, num;
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
scanf ("%d", &box[i][j]);
}
}
scanf ("%d", &n);
for (int k = 0; k < n; k++){
scanf ("%d",&num);
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
if(num == box[i][j]){
b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 0 | 59,159,264 |
#include <bits/stdc++.h>
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 && i<b) || (j>=a && i>=b)) cout<<0;
else cout<<1;
if(j==w-1) cout<<endl;
}
}
} | #include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define endl '\n'
#define pii pair<long long int,long long int>
#define vi vector<ll>
#define all(a) (a).begin(),(a).end()
#define F first
#define S s... | 0 | 34,471,484 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n; cin>>n;
vector<int> p(n+1,1);
for(int i=2; i<=n; ++i) for(int j=1; j*i<=n; ++j) ++p[j*i];
long long res=0;
for(long long i=1; i<=n; ++i) res+=i*p[i];
cout<<res<<endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <deque>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | 0 | 16,544,491 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int c1 = 0, c2 = 0;
for (int i = 0, lim = s.size(); i < lim; i++)
{
if (i % 2 == 0) {
s[i] == '0' ? c2++ : c1++;
}
else {
s[i] == '1' ? c2++ : c1++;
}
}
cout... | #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>
#incl... | 0 | 37,641,240 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
char a,b;
cin>>a;
b='A';
string s="qwertyuiopasdfghjklzxcvbnm";
for(int i=0;i<s.size();i++){
if(s[i]==a){
b='a';
}
}
cout<<... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | 0 | 34,136,823 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<climits>
using namespace std;
const int V_MAX=100000;
const int E_MAX=100000;
vector<int> G[V_MAX];
int used[V_MAX]={};
int flag=false;
vector<int> sorted;
void dfs(int s){
if(used[s]==1){return;}
used[s]=2;
for (int i=0;i<G[s].size();i++){
if(used[G... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<pair<ll,ll>>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typena... | 0 | 56,572,403 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define ALL(a) ... | #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 | 12,482,063 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
int n; cin >> n;
int a[100001],v[100001];
int Max = -1;
rep(i,n) cin >> a[i];
memset(v,0,sizeof(v));
rep(i,n){
v[a[i]+1] ++;
if(a[i] != 0) v[a[i]-1... | #include <iostream>
using namespace std;
int ToNum(string str){
int num = 0;
for(int i = 0 ; i < str.size(); i++){
if(str[i] == 'm'){
if('0'<=str[i-1]&&str[i-1]<='9' && i-1 >= 0){
num+=10000*(str[i-1]-'0');
}else num+=10000;
}else if(str[i] == 'c'){
if('0'<=str[i-1]&&str[i-1]<='9' && i-1 ... | 0 | 96,459,015 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | 0 | 46,573,601 |
#include <vector>
#include <bitset>
#include <limits>
#include <iostream>
long long solve(int n, int k, const std::vector<long long> & a) {
long long cost { std::numeric_limits<long long>::max() };
for (int i = 0; i < (1 << n); ++i) {
const std::bitset<15> bits(i);
if (bits.count() < k) {
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
string w[n];
vector<string> v;
cin >> w[0];
v.push_back(w[0]);
for (int i=1; i<n; i++) {
cin >> w[i];
if(w[i][0] != w[i-1][w[i-1].size()-1]) {
cout << "No... | 0 | 68,477,044 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | 0 | 19,949,913 |
#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, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
int ans = 0;
rep(i,n) rep(j,d) cin >> x[i][j];
rep(i,n) for(int j = i + 1; j <... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | 0 | 42,416,447 |
#include <iostream>
using namespace std;
class priorityQueue {
private:
long *queueArray;
long size;
public:
priorityQueue() {
this->queueArray = new long[2000001];
this->size = 0;
}
void print() {
for (int i = 1; i <= size; i++) {
cout << queueArray[i] << " ";
... | #include<bits/stdc++.h>
using namespace std;
int main() {
int a, b; cin >> a >> b;
string s; cin >> s;
bool acceptable = 1;
set<char> numbers;
numbers.insert('0');
numbers.insert('1');
numbers.insert('2');
numbers.insert('3');
numbers.insert('4');
numbers.insert('5');
numbers.insert('6');
number... | 0 | 14,417,744 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int n; cin >> n;
int a, b; cin >> a >> b;
vector<int> p(n);
REP(i, n) cin >> p[i];
int cnt1, cnt2, cnt3;
cnt1 = cnt2 = cnt3 = 0;
REP(i, n) {
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<pair<string, int>> card;
for(int i = 0; i < n; i++){
string s; cin >> s;
bool flag = true;
for(int j = 0; j < card.size(); j++){
if(card.at(j).first == s){
card.at(j).second++;
flag = false;
... | 0 | 87,648,120 |
#include <stdio.h>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j = 0, n, m, ans = 0;
scanf("%lld%lld", &n, &m);
pair<ll, ll> p[n];
priority_queue<ll> q;
for(i = 0; i < n; ++i) scanf("%lld%lld", &p[i].first, &p[i].second);
sort(p,... | #include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define... | 0 | 849,006 |
#include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector <vc> vvc;
typedef vector <vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef ... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | 0 | 37,503,660 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:ve... | #include <iostream>
#include <vector>
using namespace std;
int main(void){
int m,n;
cin >> m >> n;
vector<vector<string>>word(m,vector<string>(n));
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
cin >> word[i][j];
}
}
int a;
char b;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
if(wor... | 0 | 71,302,538 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
ll mod = 1'000'000'000 + 7;
int main(){
ll N,K; cin >> N >> K;
vector<ll> A(N);
vector<ll> CT(2000+10,0);
rep(i,N){
int x; cin>>x;
A[i]=x;
CT[x]++;
}
ll ans=0;... | 0 | 62,318,594 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | #include <bits/stdc++.h>
using namespace std;
vector<int> countingSort(const vector<int>& A)
{
const int max = *max_element(A.cbegin(), A.cend());
vector<int> counter(max+1);
for (auto a : A) {
++counter[a];
}
int sumCount = 0;
for (auto& c : counter) {
c += sumCount;
su... | 0 | 96,943,915 |
#include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 42,944,067 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
#define pb push_back
#define fi first
#define be begin()
#define en end()
#define se second
using ll = long long;
using namespace std;
using pint = pair<int,int>;
using pll = pair<l... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <it... | 0 | 61,276,085 |
#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pii pair <int,int>
ll mod=1000000007;
int main()
{
fast;
int n;cin>>n;
int k;cin>>k;
int c=0;
for(int i=0;i<n;i++)
{
int x;cin>>x;
if(x>=k)c++;
}
co... | #include<iostream>
#include<stdio.h>
#include<cctype>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int a,b,n;
char t;
string str,order,p;
cin >> str >> n;
for(int i=0;i<n;i++){
cin >> order >> a >> b;
if(order == "print"){
cout <... | 0 | 60,941,461 |
#include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
int a, b, c, cnt;
cin >> a >> b >> c;
for(int i = a ; i < b+1 ; i++){
if(c % i == 0){
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... | 0 | 16,246,426 |
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)
#define repp(a,b,c) for(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | 0 | 71,723,340 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
int w;
cin >> S >> w;
int i = 0;
while(i < S.size()){
cout << S.at(i);
i += w;
}
cout << endl;
} | #include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
#define NUM 100
#define INF 1000000000
int X_dim[NUM];
int Y_dim[NUM];
int M[NUM][NUM];
void init(){
for(int i = 0; i < NUM; i++){
for(int j = 0; j < NUM; j++){
if(i == j){
M[i][j] = 0;
}els... | 0 | 75,012,040 |
# include <bits/stdc++.h>
# define sz(x) (int)((x).size())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int N = (int) 3e5 + 5;
const int inf = (int) 1e9 + 7;
int n, l;
int a[N];
ll p[N];
set<pii> s;
set<int> can;
ll sum(pii x) {
return p[x.second] - p[x.first - ... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
int main(void){
string s;
cin >> s;
if (s.size() == 2){
if (s[0] == s[1])
cout << 1 << " " << 2 << endl;
else
cout << -1 << " " << -1 << endl;
}
else {
ll n = s... | 0 | 61,558,876 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, int>> v;
rep(i, n) {
ll a;
int b;
cin... | #include <bits/stdc++.h>
using namespace std;
int main(){
cin.sync_with_stdio(false);
int n, k; cin >> n >> k;
vector<int>v(n);
for(int i = 0; i < n; i++){
cin >> v[i];
}
vector<int>cost(n, INT_MAX);
cost[n-1] = 0;
for(int i = n-2; i >= 0; i--){
for(int j = i+1; j <= i+k ... | 0 | 63,433,000 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main() {
int n; cin >> n;
string tmp;
vector<string> deck, copy;
for (int i = 0; i < n; i++) {
cin >> tmp;
deck.emplace_back(tmp);
}copy = deck;
for (int i = 0; i < deck.size(); i++) {
for (int j = deck.size()-... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> graph(n);
int a, b;
rep(i, m) {
cin >> a >> b;
a--;
b--;
g... | 0 | 65,308,580 |
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
void pr(int n){
int ans=0;
vector<bool> prime;
for(int i=0;i<=n;i++){
prime.push_back(true);
}
prime[0]=prime[1]=false;
for(int i=2;i<=n;i++){
if(prime... | #include <iostream>
int main() {
for( int i = 1 ; i <= 10000 ; i++ ) {
int x ;
std::cin >> x ;
if( x != 0 ) {
std::cout << "Case " << i << ": " << x << std::endl ;
} else {
break ;
}
}
} | 0 | 41,390,513 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string S;
cin >> S;
ll cnt = 0;
if(S[0] != 'A'){
cout << "WA" << endl;
return 0;
}
for(int i = 2; i < S.size() - 1; i++){
if(S[i] == 'C') cnt++;
}
if(cnt != 1){
cout << "WA" <<... | 0 | 70,198,048 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
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... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main(void){
int n;
cin >> n;
vector<int> t(n);
vector<bool> dt(n, false);
vector<int> a(n);
vector<bool> da(n, false);
dt[0] = true;
da[n-1] = true;
for(int i=0; i<n; i++){
... | 0 | 42,734,920 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | #include<queue>
#include<algorithm>
#include<cstdio>
#include<vector>
#include <iomanip>
#include<cstring>
#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
vector<P>v;
bool cmp(P a,P b)
{
return atan2(a.second,a.first)<atan2(b.second,b.first);
}
int main()
{
... | 0 | 82,942,953 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep1(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(){
int h, w, k;
cin >> h >> w >> k;
vector<vector<char>> C(h, vector<char>(w));
vector<vector<char>> C_copy(h, vector<cha... | 0 | 88,035,219 |
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define rep0(a,b) for(int a=0;a<b;a++)
#define rep1(a,b) for(int a=1;a<=b;a++)
#define repp(a,b,c) for(i... | #include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
typedef vecto... | 0 | 22,329,240 |
#include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define rep(i,n) for(int i = 0; i < (n); i++)
#define Srep(i,a,n) for(int i = (a); i < (n); i++)
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
int k,a,b,judge=0;
cin >> k >> a >> b;
for(int i = a; i < b + 1; i++){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, Q;
cin >> N >> Q;
vector<vector<int>> E(N);
for (int i = 0; i < N - 1; i++){
int a, b;
cin >> a >> b;
a--;
b--;
E[a].push_back(b);
E[b].push_back(a);
}
vector<int> p(N, -1);
vector<vector<int>> c(N);
queue<int> q;
... | 0 | 49,800,806 |
#include<iostream>
#include<algorithm>
#include<cstdlib>
using namespace std;
int main() {
while (true) {
int coin = 0;
int price = 0;
cin >> price;
if (price == 0) {
break;
}
price = 1000 - price;
for (auto temp : { 500, 100, 50, 10, 5, 1 }) {
const auto temp_div = div(price, temp);
coin += tem... | #include <bits/stdc++.h>
using namespace std;
#ifdef zxc
#include <sys/resource.h>
#include "debug.h"
#include "profile.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define profile(X) LOG_DURATION(X)
#else
#define debug(...) 42
#define profile(...) 42
#endif
using ll = int64_t;
usin... | 0 | 50,062,931 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ll N, K;
cin >> N >> K;
vector<pair<ll, int>> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i].second >> v[i].first;
}
sort(v.begin(), v.end(), [](auto x, auto y) {
return x.first > y.first;
});
... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
const do... | 0 | 37,181,206 |
#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>
using namespace std;
int main(){
int x;
int a,b,c;
cin >> a >> b >>c;
if(b < a){
x = a;
a = b;
b = x;
}
if(c < a){
x = a;
a = c;
c = x;
x = b;
b = c;
c = x;
cout << a << " " << b << " " << c << e... | 0 | 86,525,030 |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
long long n;
cin >> n;
long long ret = 0;
long long a = sqrt(n);
for (long long i = 2; i < a; ++i) {
long long count = 0;
long long check = 1;
long long check2 = 2;
while (n % i == 0) {
n /= i;
++count;
if (count == check) {
... | #include <iostream>
#include <vector>
typedef long long LL;
using namespace std;
int main(){
LL n;
cin >> n;
vector<vector<LL>> a_bin(n+1,vector<LL>(20, 0));
vector<LL> a(n);
for(LL i=0; i<n; i++){
cin >> a[i];
}
LL tmp;
for(LL i=1; i<=n; i++){
tmp=a[i-1];
for(LL ... | 0 | 73,651,420 |
#include <iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int count;
for (int i = a; i <= b; i++)
if (c % i == 0)
count++;
cout << count << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
int M,Nmin,Nmax;
cin >> M >> Nmin >> Nmax;
while(M){
vector<int> V(M);
rep(i,0,M)cin >> V[i];
int maxd = 0,maxi;
... | 0 | 7,645,114 |
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
list<int> l;
int n;
cin >> n;
for(int i=0;i<n;i++){
string comm;
int x;
cin >> comm;
if(comm=="insert"){
... | 0 | 49,688,990 |
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
int n = 1;
std::cin >> n;
while (n)
{
std::vector<int32_t> num_list{};
while (n--)
{
int tmp = 0;
std::cin >> tmp;
num_list.push_back(tmp);
}
std::vector<int32_t> comfarm_list{};
std::vector<int32_t> sum_list{};
for( auto... | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#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;
int main() {
... | 0 | 66,947,509 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
set<int> s;
cin >> a >> b >> c;
s.insert(a);
s.insert(b);
s.insert(c);
cout << (int)s.size();
} | #include<bits/stdc++.h>
using namespace std;
#define N 1000000000;
#define ll long long
vector<ll>adj[100005];
std::vector<ll> vis;
ll dfs(ll node)
{
ll ans=0;
for(auto j:adj[node])
{
if(vis[j]==0)
{
... | 0 | 51,357,914 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
string s; cin >> s;
ll len = s.size(... | #include<bits/stdc++.h>
using namespace std;
#define speed() ios::sync_with_stdio(0);cin.tie(0);
#define file() freopen ("input.txt", "r", stdin);freopen ("output.txt", "w", stdout);
#define rep(i,a) for(ll i=0;i<a;i++)
#define rep1(i,begin,end) for(ll i=begin;i<=end;i++)
#define mem(dp,i) memset(dp,i,sizeof(dp))
#defi... | 0 | 38,325,846 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<((int)n); i++)
#define REP(i,n) for(int i=0; i<=((int)n); i++)
#define srep(i,a,n) for(int i=a; i<((int)n); i++)
#define SREP(i,a,n) for(int i=a; i<=((int)n); i++)
#define rrep(i,n) for(int i=n-1; i>=0; i--)
#define RREP(i,n) for(int i=n; i>=0; i--)
#define INF 1... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define MOD 1000000007
using namespace std;
int d[10];
bool valid(int n) {
while(n) {
if(d[n%10]) return false;
n/=10;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL)... | 0 | 11,975,399 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int ... | 0 | 57,550,219 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
ll gcd(ll a, ll b)
{
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(a % b, b);
}
int main()
{
ll n, k;
cin >> n >> k;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string s;
int num_front=0;
int num_back=0;
cin >> n;
cin >> s;
for(int i=0; i<n; i++){
if(s[i]=='('){
num_front++;
}
if(s[i]==')'){
if(num_front!=0){
... | 0 | 43,321,150 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (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 rep2(i, s, n) for (int i = (s); i <... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) ... | 0 | 53,076,086 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int> > gg(n);
rep(i, n) {
int a,b;
cin >> a >> b;
gg[i] = make_pair(a,... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
for (;;) {
scanf("%d %d",&h,&w);
if (h==0) break;
for (int i=0;i<h;i++) {
for (int j=0;j<w;j++) {
printf("#");
}
printf("\n");
}
printf("\n");
}
r... | 0 | 58,350,386 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#def... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using gt... | 0 | 2,755,508 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
ll mod_pow(ll x,ll n,ll mod) {
ll res=1;
while(n>0) {
if(n&1) {
res=res*x%mod;
}
x=x*x%mod;
n>>=1;
}
return res;
}
int main() {
ll X,Y;
cin>>X>>Y;
if(X>2*Y||Y>2*X) {
cout<<0<<endl;
return 0;
}... | #include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;
struct point { double x,y;};
void koch(int n,point a,point b){
if(n == 0) return;
point s,t,u;
double th = M_PI * 60.0 / 180.0;
s.x = (2.0 * a.x + 1.0 * b.x) / 3.0;
s.y = (2.0 * a.y + 1.0 * b.y) / 3.0;
t.x = (1.0 * a.x... | 0 | 84,624,174 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x,y,z) max((x),max((y),(z)))
#define tmin(x,y,z) min((x),min((y),(z)))
typedef long long ll; ll MM = 1000000000;ll mod = MM + 7; ll MMM=9223372036854775807;
ll GCD(ll x, ll y) {if (y =... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/format.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i =... | 0 | 52,832,925 |
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
using namespace std;
int main() {
string s,t;
cin >> s;
bool flag = 0;
for(char ch = 'a'; ch <= 'z'; ch++) {
for(int i = 0; i < s.size(); i++) {
if(ch == s[i]) {
flag = 0;
break;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
typedef string str;
const double pi=3.14159265358979323846;
const long long inf = 1LL << 60;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -... | 0 | 99,234,640 |
#include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
using namespace std;
int main() {
long long int N, Ans = 0, total = 0;cin >> N;
map<long long int, long long int> P;
map<long long int, long long int> Q;
vector<long int> V(N);
for(int i = 0; i < N; i++){
cin >> V[i];
P[V[i]]++;
}
for(auto ... | #include<bits/stdc++.h>
using namespace std;
#define FastRead ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl "\n"
#define sq(x) ((x)*(x))
#define pi acos(-1.0)
#define NUM 1000005
typedef long long ll;
int main()
{
FastRead
string s;
ll cnt1... | 0 | 45,881,699 |
#include<iostream>
using namespace std;
int main(){
while(1){
int h,w;
cin>>h>>w;
if(h==0&&w==0) break;
for(int i=0;i<h; i++){
for(int j=0; j<w; j++){
if(i==0 || i==h-1 || j==0 || j==w-1) cout<<'#';
else cout<<'.';
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N;
cin >> N;
ll big =0;
ll small=0;
vector<ll> a(N);
for(int i=0;i<N;i++){
cin >> a[i];
}
vector<ll> b(N);
for(int i=0;i<N;i++){
cin >> b[i];
}
for(int i=0;i<N;i++){
ll ... | 0 | 98,699,807 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using ll=long long;
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int h[n];
int a[m],b[m];
int d[n]={0};
rep(i,n){
cin>>h[i];
}
rep(i,m){
cin>>a[i]>>b[i];
if(h[a[i]-1]>h[b[i]-1]){
d[b[i]-1]=1;
}
else if(h[b[i]-1]>... | #include <iostream>
#include <map>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int b, f, r, v;
map<int, map<int, map<int, int> > > m;
while (cin >> b >> f >> r >> v) {
map<int, map<int, map<int, int> > >::iterator it = m.find(b);
... | 0 | 40,229,648 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <limits>
#include <cmath>
using namespace std;
template<class T>
class Input {
public:
auto operator()() const {
T v;
cin >> v;
... | #include<bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define mp make_pair
#define PI acos(-1)
using namespace std;
map<ll,ll>cnt;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll i,j,k,x,y,z,m,n,t,a,b,c,l,r,q;
cin>>k>>n;
for(i=1; i<=n; i++)
{
... | 0 | 20,095,649 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int v,e,s,t,a[10001]={};
vector<int> vec[10001];
cin >> v >> e;
for(int i=0;i<e;i++){
cin >> s >> t;
vec[s].push_back(t);
a[t]++;
}
stack<int> st;
for(int i=0;i<v;i++){
if(a[i] == 0) st.push(i);
}
while(!st.empty()){
cout << ... | #include <iostream>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
using namespace std;
int main(int argc, char const* argv[])
{
int a=0;
int b=0;
int tmp;
for (int i = 0; i < 4; i++)
{
cin >> tmp;
a += tmp;
}
for (int i = 0; i < 4; i++)
{
... | 0 | 87,549,071 |
#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>;
ll x = 1e9 + 7;
const int INF = 1001001001;
int main() {
int n, r;
cin >> n >> r;
if (n >= 10) cout << r << endl;
else cout << r + 100*(10-n) << endl;
return 0... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int imp = 0;
const int N = 1e5;
ll a[N];
vector<int> treeone[N];
bool calc(int i, ll s, ll mx) {
ll tx;
if(mx * 2 < s) {
tx = s / 2;
} else {
tx = s - mx;
}
return s - a[i] <= tx;
}
ll dfs(int i, int p = -1) {
if(imp) return -1;
if... | 0 | 96,792,129 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#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() {
ll L, R;
cin >> L >> R;
if (R - L >= 2019) {
cout << 0 << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x,n,c,b;
cin>>x>>n;
c=x;
b=x;
vector<int> a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
int flag=0;
for(int i=0;i<x;i++){
for(int j=0;j<n;j++){
if(x-i==a.at(j)){
break;
}
if(j==n-1){
c=i;
fla... | 0 | 56,975,196 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
int main(){
ll N , X;
cin >> N >> X;
vector<ll> x(N + 1 , 0);
vector<ll> num(N , 0);
x[0] = X;
for(int i = 1; i <= N; i++) cin >> x[i];
for(int i = 0; i < N; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20)
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
int n, m, a;
int cnt[111111] = {};
signed main() {
INCANT;
cin>>n>>m;
for (in... | 0 | 62,464,727 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N,d;
string ans="No";
cin>>N;
while(N>0){
d=N%10;
N=N/10;
if(d==7){
ans="Yes";
}
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define TEMP_T template<typename T>
TEMP_T void sort(T& v){ sort(v.begin(), v.end()); }
TEMP_T void revs(T& v){ reverse(v.begin(), v.end()); }
TEMP_T void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end())); }
TEMP_T void show(T& v, char delim=' ', char end='\n'){ for(... | 0 | 24,943,677 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M1 1000000007
#define M2 998244353
const double pi = 3.14159265;
#define ll long long
#define pll pair<ll,ll>
#define forr(i, n) for(ll i=0;i<n;i++)
#define pb ... | #include <bits/stdc++.h>
#include <chrono>
#include <algorithm>
#include <signal.h>
#include <thread>
#include <pthread.h>
#include <omp.h>
#define pb push_back
#define fi first
#define se second
#define Vi vector<int>
#define Vb vector<bool>
#define Pi pair<int, int>
#define MP make_pair
#define MT make_tuple
#define ... | 0 | 11,621,455 |
#include <iostream>
int main(int argc, char const *argv[]) {
int house[4][3][10] = {};
int n;
std::cin >> n;
for(int i=0;i<n;i++){
int block,floar,r,v;
std::cin >> block >> floar >> r >> v;
if(v > 0){
house[block-1][floar-1][r-1] += v;
if(house[block-1][floar-1][r-1] > 10) house[block-1]... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define tc(t) int t; cin>>t; while(t--)
#define f(n) for(int i=0;i<n;i++)
#define endl "\n"
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<int>v(n);
f(n)cin>>v[i];
vector<int> dp(n+1... | 0 | 35,603,655 |
#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 pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int main(){
int n;
cin>>n;
string s,t;
while(n--){
cin>>s>>t;
int si=0;
rep(i,s.size()... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 57,648,761 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
vector<vector<int>> edge(n, vector<int>());
vector<vector<int>> weight(n, vector<int>());
for(int i=0; i<n-1; i++){
cin >> a[i] >> b[i] >> c[i];
a[i]-... | 0 | 3,984,778 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, s;
cin >> n;
s = n*(n+1)/2;
cout << s;
return 0;
} | #include<iostream>
using namespace std;
int t[86401];
int convert(int h,int m,int s){
int sec=0;
sec=s+(m*60)+(h*3600);
return sec;
}
int main(){
int n;
int h,m,s;
char dum;
while(1){
cin >>n;
if(n==0)break;
for(int i=0 ; i < 86401 ; i++)t[i]=0;
int cnt=1;
for(int i=0 ; i < n ; i++){
... | 0 | 77,349,861 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+10;
int n,cnt,e,f[N],a[N],id[N],siz[N],res[N],head[N],link[N*2],to[N*2];
bool vis[111111];
map <int,int> mp;
bool cmp(int x,int y){return a[x]<a[y];}
void add(int u,int v){to[++e]=v,link[e]=head[u],head[u]=e;}
void dfs1(int u,int dep){
... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
#define MOD 1000000007
#define MAXN 200005
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define pb push_back
#define f first
#define s second
#define debug(x) cout << "debug 1: " << x << "\n";
#define debug2(x, y) cout... | 0 | 48,615,301 |
#include<bits/stdc++.h>
#define MAX 400
#define inf 1<<29
#define linf 1e18
#define eps (1e-8)
#define mod 1000000007
#define pi M_PI
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define pd(a) printf("%.10f\n",(double)(a))
#define FOR(i,a,b) for(int i=(... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e6+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 1000000007
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=100... | 0 | 9,100,299 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int (i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define UNIQUE(o) (o).erase(unique(sort(all((o)))))
typedef long long ll;
const int M = 200;
int p[M];
int main() {
int m, ... | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 0 | 26,995,126 |
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<stdio.h>
#include<time.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<string>>PS(M, vector<string>(2));
for(int i=0; i<M; i++)cin >> PS.at(i).at(0) >> PS.at(i).at(1);
int AC=0; int WA=0;int P;
vector<int>F(N, 1);
vector<int>count(N);
for(int i=0; i<M; i++){
P = stoi(PS.at... | 0 | 74,125,933 |
#include <iostream>
#include <vector>
using namespace std;
int findGroup(int N){
for(int i=2;;i++){
int sum = i*(i-1)/2;
if(sum == N) return i;
if(sum > N) return -1;
}
return -1;
}
vector<vector<int>> solve(int N){
int group = findGroup(N);
if(group == -1 || 2*N%group != 0) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,f,n) for(ll i=f; i<(n); i++)
int main()
{
ll ans = -1;
ll n, k;
cin >> n >> k;
vector<ll> a;
REP(i,0,n){
ll ins;
cin >> ins;
a.push_back(ins);
}
REP(i,0,1<<n){
ll cnt = 0, ue = 0;
ll mae = a[0]-1;
REP... | 0 | 27,816,530 |
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string... | 0 | 67,949,104 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
string a_s = string(b, '0' + a);
string b_s = string(a, '0' + b);
if (a_s <= b_s)
{
cout << a_s << endl;
}
else
{
cout << b_s << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define POSL(x,v) (lower_bound(x.begin(),x.... | 0 | 51,982,890 |
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
template <class T> inline bool chmax(T &a, const T &b) {
if(a >= b) return false;
a = b;
return true;
}
template <class T> inline ... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 49,874,997 |
#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(){
ll n = 0;
cin >> n;
for(int i = 0;i < 30;i++){
for(int j = 0;j < 30;j++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
int n,m;
cin >> n >> m;
vector<double> a(n);
for(auto &c:a) cin >>c;
sort(a.rbegin(),a.rend());
double tmp = accumulate(a.begin(),a.end(),(double)0)/(4*m);
for(int i=0;i<m;++i){
... | 0 | 68,158,235 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s[0] <= 'z' && s[0] >= 'a') {
cout << "a" << endl;
} else {
cout << "A" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
int a[h][w], row[h] = {}, col[w] = {};
string s;
for (int i=0; i<h; i++) {
cin >> s;
for (int j=0; j<w; j++) {
if (s[j] == '#') {
a[i][j] = 1;
row[i]++;
... | 0 | 4,392,025 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for(ll i = 0; i < n; i++)
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,sum=0; cin>>N;
vector<ll>A(N,1);
stack<ll>S;
for(int i=2; i<=N; i++){
A[i-1]=A[i-2]+i;
}
while(sum!=N){
if(sum<N){
auto IT=lower_bound(A.begin(), A.end(), N-sum);
ll z=IT-A.begin();
sum+=A[z];
... | 0 | 95,994,913 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.