code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
int n,a[2000000],i,j,k;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
int max1=0,max2=0;
for(i=0;i<n;i++)
{
if(max1<=a[i]){max2=max1;max1=a[i];}
else if(max2<=a[i]){max2=a[i];}
}
for(i=0;i<n;i++)
{
if(a[i]==max... | #include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
int main(){
int a, b, C;
cin >> a >> b >> C;
double pi, S, L, h;
pi = atan(1.0) * 4.0;
h = b * sin(pi * C / 180);
S = a * h / 2;
L = a + b + sqrt(pow(a - b * cos(pi * C / 180), 2) + pow(h, 2));
cout << fixed << S << endl;
cout << fix... | 0 | 95,145,333 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
const ll C = 1000000000+7;
int main() {
int N, K;
cin >> N >> K;
int count = 1;
N -= K;
while(N > 0) {
N -= (... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
int n;
while(cin>>n){
string s[n],x;
int sum=0,time[n];
for(int i=0;i<n;i++){
cin>>s[i]>>time[i];
}
cin>>x;
... | 0 | 55,926,044 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,H,W,D,L,R,Q;
cin >> H >> W >> D;
int dp[H*W+1],x[H*W+1],y[H*W+1];
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
cin >> A;
x[A] = i;
y[A] = j;
}
}
for (int i = 1; i <= D; i++) {
dp[i] = 0;
}
for... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | 0 | 76,651,106 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define INF 1e9
#define MAXN 100005
#define MAXM 100005
#define ll long long
#define vi vector<int>
#define vll vector<long long>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pii pair... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 100,844,048 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
void chmin(int &a, int b) { if (a > b) a = b; }
int N, A, B, C;
int L[10];
int rec(int i, int a, int b, int c){
... | #include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N;
cin >> N;
vector<int64_t> A(N);
vector<int64_t> B(N);
for (int64_t i = 0; i < N; ++i) {
cin >> A[i];
}
queue<... | 0 | 15,123,190 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
vector<string> re... | #include<bits/stdc++.h>
using namespace std;
#define BIG 1000000007
#define ll long long int
int main(){
string s;
int n,ans,p=1,m,c,x,i;
cin>>n;
for(int l=0;l<n;l++){
ans=0;
m=c=x=i=0;
for(int j=0;j<2;j++){
cin>>s;
for(int k=0;k<s.size();k++){
if('2'<=s[k] && s[k]<='9'){
p=atoi(&s[k... | 0 | 97,298,179 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
int maxi=max(10*a+b+c,max(10*b+a+c,10*c+b+a));
cout << maxi;
} | #include <stdio.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
using namespace std;
ll p10[15];
int nbits=-1;
char a[2],b[2],c[2],d[2];
int num[15]... | 0 | 41,523,405 |
#include <bits/stdc++.h>
using namespace std;
void solve(int r)
{
cout << r * r << endl;
}
int main()
{
int r;
cin >> r;
solve(r);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((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 mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
const int N = 1000... | 0 | 100,053,500 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a=N/7;
string s="No";
for(int i=0;i<a+1;i++){
if((N-i*7)%4==0) s="Yes";
}
cout << s <<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
const int MAX_V = 100;
int V, E;
int s,... | 0 | 38,128,518 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, sum;
cin >> n >> sum;
long long a[n + 1];
for(long long i = 1; i <= n; i++) {
cin >> a[i];
}
bool f = false;
long long pos = -1;
for(long long i = 1; i < n; i++) {
if(a[i] + a[i + 1] >= sum) {
f = true;
... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < (ll)n; ++i)
#define INF 10e12
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
int main(void)
{
int n;
... | 0 | 57,015,152 |
#include <iostream>
#include <cctype>
#include <string>
using namespace std;
int main() {
string str;
getline(cin, str);
for (int i = 0; i < str.length(); i++) {
if (islower(str[i])) str[i] = toupper(str[i]);
else if (isupper(str[i])) str[i] = tolower(str[i]);
}
cout << str << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const do... | 0 | 82,636,202 |
#include <iostream>
using namespace std;
const int N = 100010;
typedef long long ll;
int n,m;
int mod = 1e9+7;
int a[N],b[N];
int main()
{
ll num;
ll sum1 = 0,sum2 = 0;
cin >> n >> m;
for (int i = 1; i <= n; i ++ )
{
cin >> num;
sum1 += (i-1)*num-(n-i)*num;
sum1 %= mod;
}
for (int i = ... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<long long> a(N);
for(int i = 0; i < N; i++) cin >> a[i];
vector<long long> kumi, sum(N + 1, 0);
for(int i = 1; i < N + 1; i++){
sum[i] = sum[i - 1] + a[i - 1];
}
for(int i = 1;... | 0 | 87,591,530 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
ll h, n;
cin >> h >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
ll sum = 0;
bool f = 1;
rep(i, n) {
sum += a[i];
if(... | 0 | 80,485,952 |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int A, B, C, D;
scanf("%d%d%d%d", &A, &B, &C, &D);
if(A + B > C + D){
printf("Left\n");
}
else if(A + B == C + D){
printf("Balanced\n");
}
else{
printf("Right\n");
}
return 0;
} | #include <stdio.h>
int ng[16][16];
int rec(int x, int y){
if(ng[x][y]) return 0;
if(x == 0 && y == 0) return 1;
if(x == 0) return rec(0, y-1);
if(y == 0) return rec(x-1, 0);
return rec(x-1, y) + rec(x, y-1);
}
int main(void){
int h, w, n, x, y, a, b;
while(scanf("%d%d", &h, &w) && (h||w)){... | 0 | 68,734,871 |
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#includ... | #include<cstdio>
#include<cstring>
int main()
{
int n,ans=0,m=1;
int num;
scanf("%d", &n);
for (int i = 0; i < n;i++)
{
scanf("%d", &num);
if(num==m)
{
m++;
}
else
ans++;
... | 0 | 16,948,032 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <list>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array)/sizeof(array[0]))
using namespace std;
string replace_with_str(string str, string str_f... | #include "bits/stdc++.h"
#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define MCP(a, b) memcpy(b,a,sizeof(b))
#defi... | 0 | 49,177,903 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
map<string, int> mp = {{"1", 0}, {"9", 0}, {"7", 0}, {"4", 0}};
string N;
bool ans = true;
for(int i = 0; i < 4; i++)
{
cin >> N;
auto itr = mp.find(N);
if(itr != mp.end())
mp.at(N)++;
}
map<string, int>::iterator it;
for(it = ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(){
int h,n; cin>>h>>n;
vector<int> dp(h+1,1e9);
dp[0] = 0;
rep(i,n){
int a,b; cin>>a>>b;
rep(j,h){
int x = min(j+a,h);
dp[x] = min(dp[x],dp[j]+b);
}
}... | 0 | 63,930,861 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | #include <bits/stdc++.h>
#include <iostream>
#include <set>
using namespace std;
typedef pair <long long,long long> pii;
int N;
pii arr[100005];
long long val[100005];
multiset <long long> larger;
multiset <long long>::iterator it;
struct quad{
long long l, ll, r, rr;
};
quad neighbouring[100005];
int main() {
... | 0 | 64,145,335 |
#include <iostream>
using namespace std;
int main()
{
int n, m, x[1000], k = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
for (int a = 0; a < n - 1; a++) {
for (int b = 0; b < n - a - 1; b++) {
if (x[b] > x[b + 1]) {
swap(x[b], x[b + 1]);
}
}
}
for (int j = 0; j < m; j++) {
k ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b;
string s;
cin >> a >> b >> s;
for (int i=0; i<s.size(); i++){
if ((i==a && s[i]!='-') || (i!=a && !(0<=s[i]-'0' && s[i]-'0'<=9))){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << ... | 0 | 62,749,684 |
#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... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
void set_reset(set<int> &s) {
set<int> s2;
s = s2;
}
int main(void){
int H, W, M;
cin >> H >> W >> M;
vector<int> h(M), w(M);
vector<int> hzt(H), vtc(W);
for (int i = 0; i < M; i++) {
cin >> h[i] >> w[i];
... | 0 | 6,178,550 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
#define Reve(a) reverse(a.begin(), a.end())
#define PI 3.14159265359
typedef long long ll;
const ll MOD = 1e9+7;
ll gcd(ll a, ll b){
if(b==0) return a;
r... | 0 | 37,702,164 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string xmaseve (string xmas, int n) {
if (n==25)
return xmas;
else if (n<25) {
return (xmaseve(xmas, n+1) + " Eve");
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n;
cin >> ... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <set>
#include <string.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REP3(i,st,en) for(ll (i)=(... | 0 | 89,475,894 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define R... | #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;
string S[300];
int main(){
int N;
cin >> N;
for(int i = 0; i < N; i++){
... | 0 | 99,417,380 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=998244353;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fal... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(ll i = (m); i <= n... | 0 | 62,389,877 |
#include <iostream>
#include <stdio.h>
bool judge(int, int, int);
int main()
{
int N;
int a;
int b;
int c;
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> a >> b >> c;
if (judge(a, b, c)){
std::cout << "YES" << std::endl;
} else {
std::cout << "NO" << std::endl;
}
}
return 0;
}
bool judg... | #include<bits/stdc++.h>
using namespace std;
#define flash ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define int long long int
#define ll long long
#define ld long double
#define vi vector<int>
#defi... | 0 | 5,185,203 |
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define INF 2e9
using namespace std;
const int N=1e6+1;
const int mod=1e9+7;
ll fastexp(ll base,ll exp){
base%=mod;
ll ans=1;
while(exp>0){
if(exp&1){
ans*=base;
ans%=mod;
}
base*=base;
base%=mod;
exp/=2;
}
return ans;
}
ll gcd(ll a,ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | 0 | 9,044,043 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k; cin >> n >> k;
set<int>s;
for(int i = 0; i < n; i++){
int d; cin>> d;
for(int j = 0; j < d; j++){
int a; cin >> a;
s.insert(a);
}
}
cout << n - s.size();
} | #include <bits/stdc++.h>
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; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 60,360,131 |
#include <iostream>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
double n=0,a=0,b=0,c=0,d=0,i=0,j=0;
cin >> a >> b >> c >> d;
i=(sqrt(((c-a)*(c-a))+((d-b)*(d-b))));
cout <<setprecision(14)<< i <<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | 0 | 59,288,445 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typed... | 0 | 61,769,789 |
#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
int main() {
int n;
std::cin >> n;
int cnt[n][26];
int ansCnt[26];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 26; j++) {
cnt[i][j] = 0;
ansCnt[j] = 2500;
}
}
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(... | 0 | 79,612,769 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<int> a(M), b(M);
for(int i=0; i<M; i++) cin >> a[i] >> b[i];
vector<int> cnt(N+1, 0);
for(int i=0; i<M; i++)
{
cnt[a[i]]++... | 0 | 14,424,886 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <cmath>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
int n;
cin >> n;
vector<int>a(n);
vector<int>b(n);
int i;
for (i = 0; i < n; i++)
{
cin >> a.at(i);
}
for (i = 0; i < n; i++)
{
b.at... | 0 | 78,261,294 |
#pragma comment(linker, "/stack:200000000")
#pragma target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int ll
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const ll inf = 1ll << 62;
#define Rep(i,a,b) for(register int... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
typedef long long lint;
namespace utils{
template <class T> inline void apn(T &x,const T y){x=x<y?x:y;}
template <class T> inline void apx(T &x,const T y){x=x>y?x:y;}
inline int nxi(){
int x=0;
char c;
while(((c=getchar())>'9'||c<'0')&... | 0 | 21,166,745 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, T, ans;
cin >> N;
T=(N-(N%15))/15;
ans=800*N-200*T;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 0 | 61,877,963 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
struct SegTree {
ll n;
vector<ll> v;
SegTree(int size) {
n = 1;
while (n < size) n *= 2;
v = vector<ll>(2 * n - 1);
}
void add(int i, ll x) {
i += n ... | #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 | 41,816,670 |
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
int N;
int A[1<<20];
int dp1[1<<20][20] = {},dp2[1<<20][20] = {};
int main(){
cin >> N;
for(int i=0;i<(1<<N);i++){
cin >> A[i];
dp1[i][0] = A[i];
}
for(int j=0;j<N;j++){
for(int i=0;i<(1<<N);i++){
... | #include <algorithm>
#include <vector>
#include <string>
#include <ctype.h>
#include <set>
#include <map>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<time.h>
#include<string>
#include<stack>
#include<cmath>
#include<iostream>
#include<cstring>
#include<complex>
#include<bitset>
#include <climits>
#inclu... | 0 | 41,513,140 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX_N 2000000
#define MAX_A 10000
int A[MAX_N + 5], B[MAX_N + 5], C[MAX_A + 5];
void countingSort(int n, int k) {
rep(i, k) C[i] = 0;
rep(i, n) C[A[i]]++;
rep(i, k - 1) C[i + 1] += C[i];
for... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define ll ... | 0 | 29,443,121 |
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <tuple>
#include <cassert>
#include <exception>
#include <io... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort(ALL((c)))
#define debug(x) \
do { \
... | 0 | 43,897,222 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int size=2e5;
const int inf=1e9;
int main(){
int N,K;cin>>N>>K;
long a; long acm[... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
double n, k;
cin >> n >> k;
double ans = 0;
... | 0 | 67,413,541 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,r;
cin>>n>>r;
if(n>=10){
cout <<r;
}
else{
cout << r+100*(10-n);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using Graph = vector<vector<int>>;
using P = pair<int,int>;
using ll =long long;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const ll LINF=(ll)1e18;
int main(){
ll n,m;
cin >> n >> m;
if(n>2 && m>2){
... | 0 | 36,236,775 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n,a,b;
cin>>n>>a>>b;
ll var1=n%(a+b);
ll var2=n/(a+b);
ll ans=var2*a + min(var1,a);
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 0 | 12,574,809 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,m;
cin>>n>>m;
map<int,int> A,B;
rep(i,m){
int a,b;
cin>>a>>b;
if(a==1)B[b]=1;
if(b==n)A[a]=1;
}
for(auto p:A){
if(B[... | #include <algorithm>
#include <iostream>
#include <vector>
const int mod = 1e9 + 7;
int main()
{
int n, a, b;
std::cin >> n >> a >> b;
int below_a = 0, between = 0, above_b = 0;
for (int i = 0; i < n; i++) {
int temp;
std::cin >> temp;
if (temp <= a) {
below_a++;
... | 0 | 24,870,982 |
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(is... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> A(3, vector<int>(3));
bool c = false;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> A.at(i).at(j);
}
}
int N;
cin >> N;
for (int h = 0; h < N; h++) {
int b;
cin >> b;
for (int i = ... | 0 | 94,348,764 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vect... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a,b,k;
cin>>a>>b>>k;
for(int i=0;i<k;i++){
if(i%2==0){
if(a%2!=0)
a--;
b+=a/2;
a/=2;
}else{
if(b%2!=0)
b--;
a+=b/2;
b/=2;
}
}
cout<<a<<' '<<b<<endl;
return 0;
} | 0 | 6,579,806 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define mod 1000000007
#define MOD 998244353
#define INF 40000000000000000
int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int dy8[8] = {1, 1, 1, 0, -1, -1, -1, 0};
int dx4[4] = {... | #include<iostream>
using namespace std;
int main()
{
long long int a,b,c,f,t;
cin>>t;
while(t--)
{
f=0;
cin>>a>>b>>c;
if(a>b && a>c)
{
if((b*b)+(c*c)==(a*a))
f=1;
}
else if(b>a && b>c)
{
if((a*a)+(c*c)==(b*b)... | 0 | 65,215,469 |
#include <bits/stdc++.h>
using namespace std;
long long nagasa[51],niku[51];
long long keisan(long long k,long long x){
if(x==nagasa[k])return niku[k];
long long kotae=0;
x--;
if(x>0){
long long l=min(x,nagasa[k-1]);
kotae+=keisan(k-1,l);
x-=l;
}
if(x>0){
kotae++;
x--;
}
if(x>0){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using VVI = vector<vector<int>>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
bool dp[30009][4][1009];
string s;
int... | 0 | 48,475,664 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(LL i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<string>;
using P =pair<int,int>;
const ll mod=1000000007;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
int main(){
int n;
cin>>n;
ve... | 0 | 63,787,635 |
#include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int main () {
int n ;
cin >> n ;
vector<... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int main()
{
fio;
ll n,x,t;
cin>>n>>x>>t;
ll ans = 0,p = 0;
while(n > ... | 0 | 76,794,813 |
#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long int64;
const int N = 2e5+5;
char s[N];
int n, f[26][N];
int64 ans;
int main()
{
scanf("%s", s+1), n = strlen(s+1);
for(int i = 1; i <= n; ++i)
for(int j = 0; j < 26; ++j)
f[j][i... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 49,425,038 |
#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<iostream>
#include<stack>
using namespace std;
int main(){
int i,cnum = 0;
stack<int> car;
while(cin >> i){
if(i != 0){
car.push(i);
cnum++;
}else if(cnum == 0){
}else{
cout << car.top() << endl;;
car.pop();
cnum--;... | 0 | 20,178,060 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int h, w;
cin >> h >> w;
vector<string> field(h);
rep(i,h) cin >> field[i];
queue<int> qu... | 0 | 37,702,416 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
string res;
res += toupper(a[0]);
res += toupper(b[0]);
res += toupper(c[0]);
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 58,975,701 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
using namespace std;
int main(){
string str;
string tmp;
while(getline(cin, str) && str != "."){
int p = 0, q = 0;
bool flag = 1;
tmp = "";
for(int i = 0 ; i < str.size() ; i++){
if(str[i] == '[' || str[i] == '(' || st... | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | 0 | 66,220,850 |
#include<iostream>
using namespace std;
int main(){
int n,m,p;
int x[100];
while(cin >> n >> m >>p, n||m||p){
int sum = 0;
for(int i=0;i<n;i++){
cin >> x[i];
x[i];
sum += x[i];
}
sum *= 100*(100-p);
sum /= 100;
if(!x[m-1])cout << 0 << endl;
else cout << sum/x[m-1] << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int w, h;
cin >> w >> h;
vector<ll> p(w), q(h), s(h + 2);
ll ans = 0;
rep(i, 0, w) {
cin >> p[i];
ans... | 0 | 9,844,035 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,c=0,i=1;
cin>>n;
while(n>c){
c+=i;
i++;
}
i--;
c-=i;
if(c==n){
for(int j=1;j<i;j++){
cout<<j<<endl;
}
}else{
c+=i;
int k=c-n;
for(int j=1;j<=i;j++){
if(j==k)
continue;
cout<<j<<endl;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
map<int,int>M;
for(int i=0;i<N;i++){
int a;
cin>>a;
if(M.count(a))
M.at(a)++;
else
M[a]=1;
}vector<int>A={0};
for(auto p:M){
auto k=p.first;
auto v=p.second;
A.push_back(v);
}sort(A.begin(),A.end... | 0 | 56,295,979 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include<iostream>
#define MAX_N 100
using namespace std;
int n, u, k, v;
int Adj[MAX_N][MAX_N];
void initialize(){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
Adj[i][j] = 0;
}
}
}
void check_adj(){
Adj[u][v] = 1;
}
void print_adj(){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
co... | 0 | 99,086,890 |
#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>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 10;
int s[N], nxt[N][30];
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, L, q;
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> s[i];
}
cin >> L >> q;
for(int i = 1; i <= n; i+... | 0 | 93,251,000 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i< (n);i++)
using namespace std;
int main() {
int n;
cin>>n;
int A[n];
double sum=0;
rep(i,n){cin>>A[i];
}
rep(i,n){ sum+=1.0/A[i]; }
cout<<fixed<<setprecision(15)<<1/sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 98,780,804 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef vector... | #include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> memo(n + 1, -1);
function<int(int)> f = [&memo, &f](int nn) -> int {
if (memo[nn] != -1) {
return memo[nn];
}
else if (nn == 0) {
mem... | 0 | 21,769,740 |
#include <iostream>
#include <string>
template <class X>
X cinas() {
X in;
std::cin >> in;
return in;
}
int main() {
std::string text;
while (std::cin >> text) {
if (text == "-") break;
int m = cinas<int>();
int total = 0;
for (int i = 0; i < m; i++) {
total += cinas<int>();
}
in... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = ((int)a) - 1; i >= ((int)a); --i)
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
using pii = pair<int, int>;
using vi = vector<int>;
using vvi... | 0 | 16,756,080 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int count=0;
for(int i=0;i<S.size();i++){
if(S.at(i)!=T.at(i)){
count++;
}
}
cout << count << endl;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
using namespace std;
uint_fast16_t d;
uint_fast32_t M = 0;
uint_fast64_t c, sd = 0, sc = 0;
char ct;
int main() {
while((ct=getchar_unlocked())>='0') M = M * 10 + ct - '0'... | 0 | 1,691,776 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int x, t;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
const int mod = 998244353;
signed main(void)
{
long long n, m, ans;
vector<long long> v(100010), cnt(100010);
cin >> n;
rep(i, n) cin >> v[i];
rep(i, n) cnt[v[i]]++;
m = 0;
rep(i, n) m = max(m, v[i]);
if (cnt[0] != 1 |... | 0 | 95,784,657 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int N; cin >> N;
vector<pair<int,int>> V(N);
rep(i,N) {
int a, b; cin >> a >> b;
V[i] = {a,b};
}
sort(V.begin(), V.end(), [](auto&& a, auto&& b){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int>v(m + 3), v2, stick(12), val(12, -1), vis(12, 0);
stick[1] = 2, stick[2] = 5, stick[3] = 5, stick[4] = 4, stick[5] = 5, stick[6] = 6, stick[7] = 3, stick[8] = 7, stick[9] = 6;
for(int i = 0; i < m; i++){
... | 0 | 44,601,534 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a;
cin >> a;
int count = 0;
for(int i = 1;i<=a-1;i++){
count += (a-1)/i;
}
cout << count;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long long unsigned llu;
typedef pair<long long, long long> pll;
const long long inf = 2000000000000000000LL;
#define pi acos(-1.0)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);c... | 0 | 29,931,124 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, fact = 1;
scanf("%d", &n);
int t = n;
while(t) {
t = t / 10;
fact = fact * 10;
}
while(fact > 1) {
fact = fact / 10;
if(n / fact == 7) {
printf("Yes\n");
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define For(i,n) for (i... | 0 | 3,436,227 |
#include <bits/stdc++.h>
#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 RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF (1<<29)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14... | 0 | 73,352,038 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
int main(void)
{
int N, x;
cin >> N >> x;
int ans;
if (N == 1)
{
ans = 1;
}
else if (N == 2)
{
if (x == 1)
ans = 2;
else
ans = 1;
}
else
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#defin... | 0 | 71,400,666 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
struct UnionFind {
int *par, *rk;
UnionFind(int maxIndex) {
par = new int[maxIndex + 1];
rk = new int[maxIndex + 1];
for (int i = 0; i <= maxIndex; i++) {
par[i] = i;
rk[i] = 0;
}
}
int find(int a) {
if (par[a] =... | #include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define rep(i, n) for (int i = 0; i < n; i++)
#defin... | 0 | 83,683,557 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
ll ans;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n;
vector<ll> a(n);
for (auto& i : a) cin >> i;
for (int i = 0; i < n; i++) {
if (!a[i]) continue;
if (i < n - 1) {
if (a[i] % 2 && a... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int H,W;
vector<int> dx = {-1,0,0,1};
vector<int> dy = {0,-1,1,0};
bool check;
cin >> H >> W;
vector<string> s(H);
for(int i=0;i<H;i++) {
cin >> s[i];
}
for(int i=0;i<H;i++) {
for(int j=0;j<W;j++) {
... | 0 | 85,234,725 |
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | #include<bits/stdc++.h>
using namespace std;
struct lis{
int d;
lis *pr;
lis *ne;
};
lis he;
int n;
void ins();
void del();
void delf();
void dell();
int main(){
cin >> n;
string ord;
lis bu={-1,&he,&he};
he=bu;
for(int i=0;i<n;i++){
cin >> ord;
if(ord=="insert")ins();
else if(ord=="delete")... | 0 | 1,176,885 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
if(a == b){
cout << "H" << endl;
}else if(a != b){
cout << "D" << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int MOD = 1e9+7;
const int mxN = 300005;
int mat[100][100];
int countPairs(int N,int D)
{
int count = 0;
for(int i = 0; i < N - 1; i++)
{
for(int j = i + 1; j < N ; j++)
{
int norm = 0;
... | 0 | 5,759,970 |
#include <iostream>
#include <array>
#include <vector>
using namespace std;
int main()
{
vector< int > vec;
int n, tmp;
cin >> n;
array< int, 10001 > arr;
for ( int i = 0 ; i < 10001 ; i++ )
{
arr[i] = 0;
}
for ( int i = 0 ; i < n ; i++ )
... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define X first
#define Y second
#define pb push_back
#define max_el(x) max_element(x.begin(),x.end())-x.begin()
#define min_el(x) min_element(x.begin(),x.end())-x.begin()
#define mp make_pair
#define endl '\n'
#define fastread ios_base::sync_with_std... | 0 | 16,150,054 |
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <iomanip>
#include<stdio.h>
#include<math.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
using namespace std;
int main(){
int i=0,n;
int num[6]={0};
int top,front;
for(i=0;i<6;i++){
cin >>num[i];
}
cin ... | #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()
#define vecin(a) rep(i,a.size())cin >> a[i]
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60... | 0 | 34,019,430 |
#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define rep(i,a,b) for(register int i=(a);i<=(b);i++)
#define dep(i,a,b) for(register int i=(a);i>=(b);i--)
using namespace std;
const int maxn=2e5+5;
int n,m,k,l,q;
int a[maxn],c[maxn];
int f[maxn][25];
int ans,tmp,cnt;
int flag;
char s[maxn];
bool ok... | #include <iostream>
#include <queue>
using namespace std;
int G[410];
int R[410][410];
int D[410];
int bfs(int src,int num);
int main() {
int W,H,root;
char c;
while (true) {
for(int i=0;i<400;i++) {
for(int j=0;j<400;j++) {
R[i][j] = 0;
}
}
for(int i=0;i<400;i++) {
G[i] = 0;
}
for(int i=0;i<4... | 0 | 77,047,830 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ff first
#define ss second
typedef long long ll;
ll power(ll a, ll b){
ll res=1;
a=a%MOD;
while(b>0){
if(b&1){res=(res*a)%MOD;b--;}
a=(a*a)%MOD;
b>>=1;
}
return res;
}
ll fermat_inv(ll y){return powe... | #include <bits/stdc++.h>
#define off exit( 0 )
#define cn continue
#define rt return
#define sc scanf
#define pr printf
#define pb push_back
#define pf push_front
#define p_f pop_front
#define p_b pop_back
#define ff first
#define ss second
#define ll long long
#define ld long double
#define N ... | 0 | 94,744,202 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (ll)(n) - 1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define INF (1LL << 62)
#define ... | 0 | 31,438,414 |
#include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
const int N=1e5+3;
int c[N];
int main()
{
ft
int t,i,j,n,m,l=0,r=0,s=0;
cin>>n;
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, int> Pli;
constexpr ll INF = 1e18;
int main() {
int N, K; cin >> N >> K;
vector<Pli> sushi(N);
for (int i = 0; i < N; i++) {
cin >> sushi[i].second >> sushi[i].first;
}
map<int, int> types;
vector<ll> ba... | 0 | 89,912,245 |
#include<iostream>
int main(void){
int n, min = 1000000, max = -1000000;
long long sum = 0;
std::cin >> n;
if (n == 0) return 0;
for (int i = 0; i < n; i++){
int x;
std::cin >> x;
sum = sum + x;
if (min > x) min = x;
if (max < x) max = x;
}
std::cout << min << " " << max << " " << sum << std::endl;
r... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int N,n,ans=0;
cin >> N;
n = N;
while(N>0){
ans += N%10;
N /=10;
}
if(n%ans==0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 0 | 11,549,829 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < n... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll a[20... | 0 | 6,974,337 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
using LL = long long;
int main... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <ll , ll>;
void in(ll &x);
const ll N = 1e5 + 10;
const ll INF = 1e9;
const ll M = 1e9 + 7;
ll n;
ll d[N], dp[N][2];
vector <ll> adj[N];
void makeRooted() {
fill (d , d + N , INF... | 0 | 59,023,576 |
#include <iostream>
#define INF 1000000
using namespace std;
int n, m;
int _dp[50010];
int c[30];
int dp(int cost){
if(_dp[cost]) return _dp[cost];
if(cost == 0) return 0;
int min = INF;
for(int i=0; i<m; i++){
if(cost - c[i] >= 0){
int temp = dp(cost - c[i]) + 1;
if(temp < min) min = temp;
}
}
_dp[cost... | #include<bits/stdc++.h>
using namespace std;
int main(){
int w, h, n; cin >> w >> h >> n;
vector<int> x(100), y(100), a(100);
int x0=0, x1=w, y0=0, y1=h;
for(int i=0; i<n; i++){
cin >> x[i] >> y[i] >> a[i];
if(a[i]==1){
x0 = max(x0, x[i]);
}else if(a[i]==2){
... | 0 | 99,485,704 |
#include<iostream>
#include<cstdio>
using namespace std;
const int N=2e5;
int dep[N],f[20][N],fst[N],to[N],n,L,q,x[N],mm,sum[N];
int query(int l,int r)
{
int ans=0;
for(int i=17;i>=0;i--)if(f[i][l]&&f[i][l]<r)ans+=1<<i,l=f[i][l];
return ans+(l!=r);
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",x+i... | #include<iostream>
#include<vector>
int main()
{
int H, W;
while (1) {
std::cin >> H >> W;
std::vector<int> v1(H);
std::vector<int> v2(W);
if (H == 0 && W == 0)break;
for (auto i = v1.begin(); i != v1.end(); i++) {
for (auto j = v2.begin(); j != v2.end(); j++) {
std::cout << '#';
}
std::cout <<... | 0 | 24,587,050 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <math.h>
#include <vector>
using namespace std;
int main(){
int a,b,c; cin>>a>>b>>c;
int maxa=a;
if(b>maxa) maxa=b;
else if(c>maxa) maxa=c;
if (maxa==a) cout<<a*10+b+c;
else if(maxa==b) cout<<b*10+a+c;
else if(maxa==c) c... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 0 | 91,649,911 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n,k;
string s;
cin >> n >> s >> k;
char a = s[k-1];
for(long long i = 0; i < n; i++){
if(s[i]!=a) s[i]='*';
}
cout << s << endl;
} | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
bool dbg = 0;
clock_t start_time = clock();
#define current_time fixed<<setprecision(6)<<(ld)(clock()-start_time)/CLOCKS_PER_SEC
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#d... | 0 | 32,357,176 |
#include <bits/stdc++.h>
#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 INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse... | 0 | 45,772,103 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
int i;
for(i=0;i<n;i++){
cin >> a.at(i);
}
int current = 1;
int count = 0;
vector<int> push(n);
for(i=0;i<n;i++){
current--;
if(a.at(current) == 2){
count++;
break;
}
else if(... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 0 | 73,366,049 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,i;
cin>>n;
ll arr[n];
map<ll,ll> mp;
for(i=0;i<n;i++)
{
cin>>arr[i];
mp[arr[i]]++;
}
ll sum=0;
for(auto itr=mp.begin();itr!=mp.end();itr++)
{
ll temp=itr->second;
s... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 998244353
#define PI 2*acos(0.0)
#d... | 0 | 89,133,388 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<string> s(N);
vector<int> t(N);
rep(i, N) cin >> s[i] >> t[i];
string X;
cin >> X;
int ans = -1;
rep(i, N) {
if (s[i] == X) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U... | 0 | 30,041,431 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define max 100001
struct node {int p,l,r;};
struct node t[max];
int d[max];
void getdepth(int i,int j){
d[i]=j;
if(t[i].r!=-1)getdepth(t[i].r,j);
if(t[i].l!=-... | #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>
#include <bitset>
using... | 0 | 99,523,795 |
#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;
deque<char> q;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<string> t = {"maerd", "remaerd", "esare", "resare"};
string ans = "YES";
reverse(s.begin(), s.end());
int i;
while(s.size() > 0) {
int tmp = s.size();
for(i = 0; i < 4; i++) {
if... | 0 | 97,973,045 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int b(string s, string t) {
int len = (int) s.size();
int count = 0;
for(int i=0;i<len;i++) {
if(s[i] != t[i]) {
count++;
}
}
return count;
}
int main() {
string s, t;
cin >> s;
cin >> t;
cout << b(s, t);
} | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 35,677,394 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,ans = 0;
cin>>n;
int arr [ n -1 ];
for(int i = 0;i<n-1;i++)
{
cin>>arr[i];
}
ans = arr[0] + arr[n-2];
for(int i = 1;i<n-1;i++)
{
ans = ans + min... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <complex>
#include <map>
#include<unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include<bitset>
#include<deque>
#include<string>
#include<list>... | 0 | 44,571,793 |
#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... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 | 79,887,843 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef long double ld;
typedef pair <ll ,ll> pll;
typedef pair <int ,int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define print(a) {for (auto iiiiiiiiii : a) cout << iiiiiiiiii << ' '; cout << ... | #include<bits/stdc++.h>
#define ll long long int
#define PI 3.14159265358979
#define zig ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
int main()
{
zig
ll n, i, minm=1010000000000000, sum;
cin>>n;
vector<ll> vec(n);
for(auto &i: vec)
cin>>i;
sort... | 0 | 13,662,775 |
#include <bits/stdc++.h>
#include <functional>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s, t;
std::cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
if (s < t) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std... | #include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define forn(i,n) for(int i=0;i<n;++i)
#define sh... | 0 | 96,574,370 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a[201],s=0;
cin>>n;
for(int i=1;i<=2*n;i++) cin>>a[i];
sort(a+1,a+2*n+1);
for(int i=1;i<2*n;i+=2) s+=a[i];
cout<<s<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 0 | 86,629,915 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> v(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v[i] = {a, b};
}
ll ret = 0;
for (int i = 0; i <= 30; i++) {
l... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 15,720,835 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include <bits/stdc++.h>
using namespace std;
string s[7];
int R, C, k;
bool func(int x, int y) {
int cnt = 0;
for (int i = 0; i < R; ++i) {
for (int j = 0; j < C; ++j) {
if(x&(1 << i) || y &(1 << j))
continue;
if(s[i][j] == '#')
++cnt;
}
}
if(cnt == k)
return true;
return false;
}
int main()... | 0 | 535,891 |
#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<string>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax... | #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... | 0 | 66,910,800 |
#include <bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
const int num = S.size();
string T;
for (int64_t tmp = 0; tmp < (1 << 3); tmp++) {
bitset<3> b(tmp);
int sum = S.at(0)-'0';
T = "";
for (int i = 0; i < 3; i++) {
if(b.test(0)){
sum += S.at(i+1)-'0';
... | #include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
const int inf=2e9+5;
const int maxn=100;
typedef vector<int> vi;
typedef long long ll;
#define fi first
#define se second
typedef pair<int,int> P;
int d[maxn+5][maxn+5];
int v,e;
void floyd()
... | 0 | 19,049,920 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.