code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
typedef long long ll;
typedef long double ld;
#define mod 1000000007
#define INF 1000000000
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<ll> leaf(n + 1);
for (int i = 0; i <= n; ++i) {
cin >> leaf[i];
}
if (leaf[0] >= 2) {
cout << -1... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
int main() {
char c[1200];
cin.getline(c, sizeof(c));
int i = 0;
while(c[i] != '\0') {
... | 0 | 59,242,017 |
#include<iostream>
#include<string>
int main(){
std::string S, T, U;
int A,B;
std::cin >> S >> T >> A >> B >> U;
if(S == U) A--;
else B--;
std::cout << A << " " << B;
} | #include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <limits.h>
#define MAX_H 1001
#define MAX_W 1001
#define MAX_N 10
using namespace std;
typedef pair<int,int> P;
int H,W,N;
int sx,sy;
int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
char Loc[MAX_H][MAX_W];
int FoodX[MAX_N];
int FoodY[MAX_N];
in... | 0 | 20,815,712 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n;
cin>>n;
int b[n-1],a[n];
for(int i=0;i<n-1;i++)cin>>b[i];
int ans=b[0]+b[n-2];
for(int i=0;i<n-2;i++){
a[i]=min(b[i],b[i+1]);
ans+=a[i];
}
c... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 0 | 46,398,657 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+1;
typedef long long ll;
#define FOR(i, a, b) for (ll i = a; i <= b; i++)
#define FORD(i, a, b) for (ll i = a; i >= b; i--)
int main()
{
ll n;
string s;
cin >> n >> s;
ll r = 0, g = 0, b = 0;
for (int i = 0; i < s.size(); i++){
if (s[i] == 'R')
r+... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd(a,b) __gcd(a,b)
#define ff first
#define ss second
#define p pair<int,int>
#define pb push_back
#define endl '\n'
#define w(t) ll test;cin>>test;while(test--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define pi... | 0 | 87,309,452 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
while (true) {
ll n, k;
cin >> n >> k;
if (n == 0 && k == 0) break;
vector<ll> A(n);
for (ll i = 0; i < n; i++) {
cin >> A[i];
}
vector<ll> s(n);
for (ll i = 0; i < n; i++) {
s[i + 1] = s[i] + ... | #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.... | 0 | 23,467,504 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 998244353
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std;
const double pi = 3.14159265359;
con... | 0 | 76,166,355 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
if (A == B && A != C) {
cout << C << endl;
}
else if (A == C && A != B) {
cout << B << endl;
}
else if (B == C && B != A) {
cout << A <<... | #include <iostream>
using namespace std;
const int INF = 1 << 30;
int main() {
int N;
int A[100000];
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[i] = a;
}
int dp[100001];
fill(dp, dp + 100001, INF);
dp[0] = -1;
for (int i = 0; i < N; i++) {
... | 0 | 72,597,954 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
long long a,b,c,k,ans;
cin>>a>>b>>c>>k;
if(k%2==0){
ans=a-b;
}
else{
ans=b-a;
}
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
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 int long long
using namespace std;
int ctoi(char c) {
switch (c) {
case '0': return 0;
case... | 0 | 34,342,787 |
#include <cstdio>
void printFrame(int x, int y) {
int i, j;
for(i=0;i<y;i++) printf("#");
printf("\n");
for(i=2;i<x;i++) {
printf("#");
for(j=2;j<y;j++) printf(".");
printf("#\n");
}
for(i=0;i<y;i++) printf("#");
printf("\n\n");
}
int main() {
int x=-1, y=-1;
... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
ll fu... | 0 | 77,011,554 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define lb lower_bound
#define si(c) (int)... | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t N, P, ans = 0;
string S;cin >> N >> P >> S;
reverse(S.begin(), S.end());
if (P == 2 || P == 5){
for (int i = 0; i < N; i++){
int sint = S[i] - '0';
if (sint % P == 0)
ans += N - i;
}
}
else{
vector<int64_t> Cou... | 0 | 47,558,060 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
string s, t; cin >> s >> t;
int n = s.size();
map<char, in... | #include<cstdio>
#include<algorithm>
using namespace std;
int main(void){
while(1){
int num[100000] = {0};
int sum = 0;
int ma = -100000;
int n,k;
scanf("%d%d",&n,&k);
if(n == 0 && k == 0) break;
for(int i = 0;i < n;i++){
scanf("%d",&num[i]);
... | 0 | 23,808,545 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4;
struct node
{
int x, y;
} point[maxn];
bool cmp(node a, node b)
{
return atan2(a.x, a.y) < atan2(b.x, b.y);
}
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> point[i].x >> point[i].y;
}
long lo... | #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 cnt[105];
int dp[105][80];
int main(){
int n;
cin>>n;
rep(i,105)cnt[i]=1;
for(int i=1; i<=n; ++i){
int x=i;
for(int j=2; j*j<=x; ++j){
w... | 0 | 70,794,036 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS_... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <list>
#define REP(i,a,b) for(i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define SQR(X) ( (X... | 0 | 52,138,570 |
#include<iostream>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define mem(ar,a) memset(ar,a,sizeof ar)
#define iOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb(x) push_back(x)
#define all(c) c.begin(), c.end()
#define int long long
#define ff ... | 0 | 9,209,793 |
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main()
{
string str, s;
getline(cin, str);
stringstream ss{str};
int cnt = 0;
int a,b;
string op;
while( getline(ss, s, ' ') ) {
if(cnt==0) a=stoi(s);
else if(cnt==1) op=s;
else b=stoi(s);
cnt ++;
}
if(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n ; cin >> n;
vector<int> vec;
for(int i... | 0 | 48,011,959 |
#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 a, b;
cin >> a >> b;
cout << 6-a-b << endl;
} | #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 | 19,708,720 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin>>n;
if(n==0){
cout <<0 << endl;
return 0;
}
long long int count=0;
if(n%2==1){
cout <<0 << endl;
return 0;
}
else{
n/=10;
count+=n;
while(n>0){
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 52,230,056 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | #include <bits/stdc++.h>
#define int long long
#define fast_io(); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define loop(i,a,b) for(int i=a;i<b;i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define ins insert
#define fi first
#define se second
#define _max max_element
#define _min min_element
... | 0 | 69,563,334 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string A,B,C;
cin>>A>>B>>C;
string a = A ;
transform(a.begin(), a.end(), a.begin(), ::toupper);
string b = B ;
transform(b.begin(), b.end(), b.begin(), ::toupper);
string c = C ;
transform(c.begin(), c.end(), c.begin(), ::toupper);
cout<<a... | #include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int N;
double x, ans = 0;
string v;
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> x >> v;
if (v == "JPY")
ans += x... | 0 | 67,045,514 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 24,701,172 |
#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>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 39,489,643 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int a, b, c; cin >> a >> b >> c;
int k; cin >> k;
int sum = 0;
while (a >= b) {
b *= 2;
sum++;
}
while (b >= c) {
c *= 2;
... | #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
using namespace std;
typedef long long ll;
#define mp make_pair... | 0 | 76,552,780 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n,t;
cin>>n>>t;
int a[n];
ll ans = 0;
ll j = 0;
for(int i = 0 ;i<n; i++) cin>>a[i];
for(int i = 0;i <n;i++)
{
if(j>a... | #include <stdio.h>
#include <string.h>
int main(){
int k,m,n,i,j,q,c[1001][1001],max=0;
char X[1000],Y[1000];
scanf("%d",&q);
for(i=0;i<q;i++){
scanf("%s %s",X,Y);
m=strlen(X);
n=strlen(Y);
for(j=m;j>=1;j--){
X[j]=X[j-1];
}
X[0]=' ';
X[m+1]='\0';
for(j=n;j>=1;j--){
Y[... | 0 | 16,269,704 |
#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>;
static const long long INF = 100000000;
int main(){
int n,k;
cin >> n >> k;
vector<long long> monster(n);
rep(i,n){
cin >> monster[i];
}
sort(monste... | #include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int N,V,P;
long long M;
cin>>N>>M>>V>>P;
long long A[100000],emp[100000];
for(int i=0;i<N;i++) cin>>A[i];
sort(A,A+N);
emp[N-P]=0;
for(int i=N-P-1;i>=0;i--){
emp[i]=A[N-P]-A[i];
emp[i]+=emp[i+1];
}
in... | 0 | 71,002,158 |
#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<(n);++i)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using ... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 7,418,819 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<pair<int, int>> r(n), b(n);
for(int i = 0; i < n; i++) cin >> r.at(i).first >> r.at(i).second;
for(int i = 0; i < n; i++) cin >> b.at(i).first >> b.at(i).second;
vector<bool> r_use... | #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 | 100,588,743 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
int tmp=0;
for(int i=0;i<N.size();i++)
tmp+=N[i]-'0';
if(tmp%9==0)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i = x; i < (int)(n); i++)
#define rep_ll(i,x,n) for(ll i = x; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[] = {-... | 0 | 6,177,239 |
#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 <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
vector<int> even(100000 + 10, 0), odd(100000 + 10, 0);
for (int i = 0; i < n; i += 2) {
... | 0 | 370,116 |
#include <bits/stdc++.h>
using namespace std;
int64_t lucas(int n) {
vector<int64_t> a;
a.push_back(2);
a.push_back(1);
if (n > 1) {
for (int i = 2; i <= n; i++) {
int64_t x = a.at(i - 2) + a.at(i - 1);
a.push_back(x);
}
}
return a.at(n);
}
int main() {
int N;
cin >> N;
cout << luc... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,a[100010],b[100010],i=1,j,saidai=0,m=0,L=0,ans=0;
cin >> n;
for(i=0;i<n+1;i++)
{
cin >> a[i];
}
for(i=0;i<n;i++)
{
cin >> b[i];
}
for(i=0;i<n;i++)
{
if(a[i]>=b[i])
{
... | 0 | 5,966,793 |
#include <bits/stdc++.h>
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<ll>())
#define ll long long
#define rep(i, s, g) for (ll i = (s); i < (g); i++)
#define MOD 1000000007
#define vfind(v, target) find(v.begin(), v.end(), target)
#define notFound(v, target) (vfind(v, tar... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
ll keta(ll a, ll b)
{
int cnt_a = 0, cnt_b = 0;
while (a)
{
cnt_a+... | 0 | 70,615,331 |
#include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define W(x, y) cerr << "\033[31m" << #x << " = " << x << "\033[0m" << y;
#else
#define W(x, y)
#endif
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vii vector<pii>
#define vl vector<ll>
#define vll vector<pll>
#de... | #include<iostream>
#include<string>
#include<vector>
using namespace std;
vector<pair<int,int> > vpii(80);
string num;
void print(int s,int f){
switch(f-48){
case 1:switch(s%5){
case 1:cout<<'.';break; case 2:cout<<',';break; case 3:cout<<'!';break;case 4:cout<<'?';break; case 0:cout<<" ";break;}break;
case 2... | 0 | 35,906,356 |
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
... | #include <iostream>
using namespace std;
int main(){
int a, b;
string s;
cin >> a >> b >> s;
for(int i=0; i<a; i++){
if(s[i]=='-'){
puts("No");
return 0;
}
}
if(s[a]!='-'){
puts("No");
return 0;
}
for(int i=a+1; i<a+b; i++){
... | 0 | 48,437,949 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=100100;
int n;
long long a[maxn];
int main()
{
cin>>n;
for(int i=1;i<=n;i++) scanf("%lld",a+i);
sort(a+1,a+n+1,greater<long long>());
int st=n;
for(int i=2;i<=n;i++) if(a[i]<0) {st=i;break;}
long long ans=0;
for(int i=1;i<st;i++) ans+=a[i];
for(int i=s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string s, t;
cin >> s >> t;
int sl = s.size(), tl = t.size();
int match = 0;
rep(i, sl-tl+1) {
int tmp = 0;
rep(j, tl) {
tmp += s[i+j] == t[j];... | 0 | 22,989,601 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int S;
cin >> S;
int W = S / 200;
cout << 10 - W << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
typedef long long ll;... | 0 | 29,927,552 |
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
Int x, y; cin >> x >> y;
int ans = 0;
while ( x <= y) {
x = (Int)2 * x;
ans++;
}
cout << ans << endl;
} | #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 | 97,009,982 |
#include<bits/stdc++.h>
using namespace std;
int n;
int main()
{
ios::sync_with_stdio(false);
cin>>n;
cout<<n*(n+1)/2<<endl;
} | #include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1e9;
int main() {
int n;
while(cin >> n, n) {
vector<vector<int>> d(10, vector<int>(10, INF));
for(int i=0; i<10; ++i) {
d[i][i] = 0;
}
for(int i=0; i<n; ++i) {
int a, b, c;
cin ... | 0 | 1,039,576 |
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
int main(){
while (1){
int n;
vector<int> student;
cin >> n;
if (n == 0) break;
for (int i = 0; i < n; i++){
int s;
cin >> s;
student.push_back(s);
}
int ans = 99999... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | 0 | 43,170,117 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <string>
#include <cmath>
using ll = long long;
using namespace std;
#define REP(i, n) for (ll i=0; i < n; i++)
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | 0 | 93,052,308 |
#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
struct card{
char suit;
int value;
};
void BubbleSort(vector<card> &a, int n){
for (int i = 0; i < n; i++){
for (int j = n - 1; j >= i + 1; j--){
if (a[j].value < a[j - 1].value)... | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <ctime>
#define ll long long
#define vecvec(h, w, name) vector<vector<ll>> name(h, vector<ll>(w));
#define rep(init, i, n) for (ll i = init; i < (n); i++)
#define rev(s) reverse(s.begin(), s.end())
#define sor(v) sort... | 0 | 89,022,403 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const int MAX = 10000;
static const ll INFTY = 1e12;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | #include <bits/stdc++.h>
#define F first
#define S second
#define MAX 10000003
using namespace std;
typedef long long int ll;
const ll mod = 998244353;
long double PI=3.1415926;
ll power(ll a,ll b){
if(b==0){
return 1;
}
ll temp=power(a,b/2)%mod;
if(b%2==0){
return (temp*temp)%mod;
}... | 0 | 69,891,057 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
int main(){
char a;
cin>>a;
if(a=='z')cout<<'a'<<endl;
else
cout<<char(a+1)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
int main() {
int A,B;cin >> A >> B;
if (A%3 == B%3){
if (A%3 == 0){
cout << "Possible" << endl;
}else{
cout << "Impossible" << endl;
}
}else{
cout << "Possible" << endl;
... | 0 | 16,761,918 |
#include <stdio.h>
#include <string>
#include <iostream>
using namespace std;
#define MAX_DATA_NUM 2000000
int heap[MAX_DATA_NUM], size = 0;
int parent(int i) { return (i-1) / 2;}
int left_child(int i) { return 2*i + 1; }
int right_child(int i) { return 2*i + 2; }
void push(int x)
{
int i = size++;
while ... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | 0 | 34,505,777 |
#include <cmath>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
bool win = false;
if ((B - A) % 2 == 0) win = true;
if (win) cout << "Alice" << endl;
else cout << "Borys" << endl;
} | #include <stdio.h>
#include <ctype.h>
int main(void)
{
char c;
int cnt[26] = {};
while (scanf("%c", &c) != EOF) {
if (islower(c)) {
int num = c - 'a';
cnt[num]++;
} else if (isupper(c)) {
int num = c - 'A';
cnt[num]++;
}
}
for (... | 0 | 85,460,534 |
#include<iostream>
using namespace std;
int main(){
int n,i=1;
long long max=-1000000,min=1000000,sum=0,a;
cin>>n;
while(i<=n){
cin>>a;
if(a<min) min=a;
if(a>max) max=a;
sum+=a;
i++;
}
cout<<min<<" "<<max<<" "<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
#define PI 3.14159265358979
using namespace std;
bool compare(const pair<ll, ll>& lh, const pair<ll, ll>& rh) {
if (lh.first < rh.first){
return true;
} else if (lh.first == rh.first){
if (lh.second >= rh.second)
... | 0 | 75,682,322 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
string s;
cin >> s;
bool flg[26] = {0};
set<char> st;
rep(i, s.length()) {
flg[s[i]-'a'] = 1;
st.insert(s[i]);
}
if ( st.size() != 26 )... | #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 ... | 0 | 12,853,361 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef struct Node{
int key;
Node *prev, *next;
} Node;
Node *nil;
void insert_cell(int key)
{
Node *x;
x = new Node;
x->key = key;
x->prev = nil;
x->next = nil->next;
x->next->prev = x;
nil->next = x;
}
void deleteNode(Node *t)
{
if(t != n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
ll mod = 1e9+7;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll c = 0;
rep(i,n){
for(int j... | 0 | 77,950,364 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i--)
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
int countBits(int in){
int res=0;
for(... | 0 | 4,610,268 |
#include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#define range(s,n) for(int i = s; i < n; i++)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int main(){
int n;
long double x1,x2,x3,x4,y1,y2,y3,y4;
while(cin >> n){
range(0,n){
cin >> x1 >> y1 >> x2 >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loopinc(i, a, b, inc) for(int i = a; i < (b); i += inc)
#define loop(i, a, b) for(int i = a; i < (b); i++)
#define rep(i, n) loop(i, 0, n)
#define rrep(i, n) for (int i = n-1; i >= 0; i--)
#define endl "\n"
#define all(c) (c).begin(),(c).end()
... | 0 | 45,380,386 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <bitset>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i = (a); i < (b); i++ )
#define REP(i, n) FOR(i,0,n)
typedef pair< ll, ll > cp2;
t... | 0 | 20,558,157 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,t,r;
cin>>t>>s;
bool g,f=0;
for(int i=t.size()-s.size();i>=0;i--){
r=t;g=1;
for(int j=0;j<s.size();j++){
if(!(t[i+j]=='?'||t[i+j]==s[j])){g=0;break;}
r[i+j]=s[j];
}
if(g){
for(int i=0;i<r.size();i++){if(r[i]=='?')cout<<'a';else cout<... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RA... | 0 | 1,168,679 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
int main()
{
int N, Z, W;
cin >> N >> Z >> W;
vector<int> a(N);
REP(i, N) cin >> a[i];
vector<int> dp_min(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 0 | 6,521,067 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<vector<int>> perms;
void add_perms(vector<int> perm, vector<bool> can_use) {
if (none_of(can_use.begin(), can_use.end(), [](bool b){ return b; })) {
perms.push_back(perm);
} else {
for (auto it = can_use.begin(); it != can_u... | # include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k; cin >> n >> k;
map<char,int> mp;
int r, s, p; cin >> r >> s >> p;
mp['r'] = p; mp['s'] = r; mp['p'] = s;
string t; cin >> t;
int ans = 0;
rep(i,k) {
char now = t[... | 0 | 80,267,037 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
using namespace std;
int main() {
int n, m, p, x, sum, num;
while (cin >> n >> m >> p, n | m | p) {
sum = 0;
for (int i = 0; i < n; i+... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll s = 0;
rep(i, ... | 0 | 34,982,125 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#define INF 10000000
using namespace std;
struct data{
int x,y;
};
int H,W,N;
int ans[1001][1001];
char field[1001][1001];
int cou,sx,sy;
void bfs(data start,int num){
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
data g;
for(int i=0;i<H;i++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int x,n,cur=1e9,ans=-1;
cin >> x >> n;
map<int,int> p;
rep(i,n){
int a;
cin >> a;
p[a]++;
}
rep(i,102){
if(p[i]) continue;
if(abs(x-i) < cur){
... | 0 | 60,154,662 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<int> a(n);
for (auto &i : a) cin >> i;
sort(all... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> a(n);
rep(i, n) {
if(s[i] == 'R')
a[i] = 0;
if(s[i] == 'G')
a[i] = 1;
if(s[i] == 'B')
a[i] = 2;
}
v... | 0 | 96,294,164 |
#include<cstdint>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<deque>
#include<stack>
#include<iterator>
#include<stack>
#include<cctype>
#include<climits>
#include<string>
#include<bitset>
#include<cfloat>
#include<iomanip... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string S;
cin >> A >> B;
cin >> S;
int l = A + B + 1;
if(S.length() != l) {
cout << "No" << endl;
return 0;
}
if(S[A] != '-') {
cout << "No" << endl;
return 0;
}
char num[10];
for(int i=0; i<=9... | 0 | 18,253,669 |
#include <iostream>
int main()
{
int N, K;
std::cin >> N >> K;
int r = N % K;
std::cout << (r == 0 ? 0 : 1) << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#de... | 0 | 38,646,552 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
#include <queue>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(long long i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll INF=(1ll<<60);
constexpr ll mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<typename T... | 0 | 89,422,184 |
#include <bits/stdc++.h>
using namespace std;
bool b(char ch){
string k="yuiophjklnm";
for(int i=0;i<(int)k.size();i++)
if(k[i]==ch) return 1;
return 0;
}
int main(){
string s;
while(cin>>s && s!="#"){
int ans=0;
bool f=b(s[0]);
for(int i=1;i<(int)s.size();i++){
if(f!=b(s[i])){ans++;f=!f... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define s(x, n) memset(x, n, sizeof(x));
#define pb(x) push_back(x)
#define NIL -1
#define MAXN 11
void solve()
{
ll h, w;
cin >> h >> w;
string s[h];
for (ll i = 0; i < h; i++)
cin >> s[i];
ll dp[h][w]... | 0 | 75,089,823 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define LIMIT 1000000007
#define rep(i, n) for(int i=0; i<(int)n; i++)
#define all(v) (v).begin(), (v).end()
namespace {
#define DEBUG(...) do{cout<<#__VA_ARGS__<<" = ";debug(__VA_ARGS__);}while(0)
#define ldebug(...) do{c... | #include <bits/stdc++.h>
using namespace std;
vector<int> to[1000000];
vector<int> ans;
void dfs(int v, int p=-1){
for(int u : to[v]){
if(u == p) continue;
ans[u] += ans[v];
dfs(u, v);
}
}
int main(){
int n, q;
cin >> n >> q;
for(int i = 0; i < n - 1; ++i){
int a, b;
... | 0 | 22,705,934 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
a-=b;
if(a<0)a=0;
cout<<a<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 1000000007
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
#define INF 12345678901234
int m... | 0 | 41,067,830 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define RFOR(i, a, b) for (ll i = a; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end()
#... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int N;
cin >> N;
vector<string> v;
for (int i = 0; i < N; i++) {
string w;
cin >> w;
if (!i) {
v.push_back(w);
continue;
}
i... | 0 | 65,865,575 |
#pragma region template 3.0
#define G3(_1, _2, _3, F, ...) F
#define G4(_1, _2, _3, _4, F, ...) F
#define G5(_1, _2, _3, _4, _5, F, ...) F
#define G6(_1, _2, _3, _4, _5, _6, F, ...) F
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
using vec = vector<T>;
template <typename T>
u... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string input;
cin >> input;
if (input[2] == input[3] && input[4] == input[5]) {
cout << "Yes" << "\n";
}else {
cout << "No" << "\n";
}
... | 0 | 6,896,922 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,p[4];
cin >> n;
p[0]=n%10; n/=10;
p[1]=n%10; n/=10;
p[2]=n%10; n/=10;
p[3]=n%10; n/=10;
if(p[1]==p[2]){
if(p[0]==p[1] || p[3]==p[1]){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long num;
vector<char> list;
cin >> num;
string b = to_string(num), c;
for (int i=0; i<3; i++) {
char a = b[i];
c=a;
list.push_back(stoll(c));}
if (list[1]<li... | 0 | 95,258,431 |
#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>
#... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<queue>
#include<cstring>
#include<climits>
#include<sstream>
#include<deque>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<bitset>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0... | 0 | 245,781 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#define int long long
using namespace std;
signed main() {
int a;
while (cin >> a,a) {
multimap<int, int>s;
multimap<int, int>o;
for (int b = 0; b < a; b++) {
string c;
cin >> c;
int e =(c[0]-48) * 36000 + (c[1] - 48... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#defin... | 0 | 82,514,726 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespa... | #include<iostream>
#include<string>
using namespace std;
struct Dice{
int P[6];
void Roll(char a){
int top;
switch(a) {
case 'E':
top = P[0];
P[0] = P[3];
P[3] = P[5];
P[5] = P[2];
P[2] = top;
break;
case 'W':
top = P[0];
P[0] = P[2];
P[2] = P[5];
P[5] = P[3];
P[3] = top;
break;
case '... | 0 | 37,378,075 |
#include<cstdio>
#include<cmath>
using namespace std;
#define pi 3.141592653589793
void koch(double x1, double y1, double x2, double y2, int n) {
if (n == 0) {
printf("%.8f %.8f\n", x1, y1);
}
else {
double sx, sy, tx, ty, ux, uy;
sx = x1 + (x2 - x1) / 3;
sy = y1 + (y2 - y1) ... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 95,025,700 |
#include <iostream>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;
int main()
{
ll H,W;
cin >> H >> W;
ll ans = INF*INF;
ll a=0,b=0,c=0;
for(int h = 0; h <= H; h++){
if(W%2==0) a = h*W/2,b = h*W/2;
else a = h*(W-1)/... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#include <bitset>
#define M 1000000007
#define M1 998244353
#define tr(container, it) \
for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define fast \
ios_base::syn... | 0 | 48,395,684 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
using namespace std;
struct Node {
string type;
int depth;
int parent = -1;
vector<int> child;
};
int main() {
int n;
Node node[100000];
queue<Node*> q;
int depth = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int id, k;
... | #include <bits/stdc++.h>
using namespace std;
array<int, 100001> arr{};
int main() {
int n, ans; ans = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
if (arr[arr[i]] == i) {
ans++;
}
}
printf("%d\n", ans);
return 0;
} | 0 | 89,058,336 |
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define fr(i,n) for(int i=0;i<n;i++)
#define frr(i,n) for(int i=1;i<=n;i++)
#define ms(x,i) memset(x,i,sizeof(x))
#define dbg(x) cout << #x << " = " << x << endl
#define all(x) x.begin(),x.end()... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vii vector<pii >
#define vll vector<ll >
#define cps CLOCKS_PER_SEC
#defin... | 0 | 82,730,993 |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e3;
int val[M], cost[M], n, memo[10001];
int solve(int h) {
if (h < 1)
return 0;
int &result = memo[h];
if (result == -1) {
result = 2e9;
for (int i = 0; i < n; i++)
result = min(result, solve(h - val[i]) + cost... | #include <bits/stdc++.h>
#include <string.h>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
int main(){
string s;
cin>>s;
int a=0,b=0;
for(i... | 0 | 78,328,005 |
#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
signed main()
{
int N;
cin >> N;
int A = -1145141919, B = 1145141919, C = 0;
for(int i=0; i<N; i++){
int a;
cin >> a;
A = max(A, a);
B = min(B, a);
C += a;
}
cout << B << " " << A << " " << C << endl;
} | #include<bits/stdc++.h>
#define IRONMAN ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define l long long
#define ull unsigned long long int
#define rep(i,n) for(int i=0; i<n; i++)
#define at(i,a) for(auto &i: a)
using namespace std;
void solve();
int main()
{
IRONMAN
#ifn... | 0 | 79,674,508 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
char x,y;cin>>x>>y;
if(x<y)puts("<");
else if(x==y)puts("=");
else puts(">... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
string ans = "No";
for(int i = 0; 4 * i <= n; i++) {
for(int j = 0;... | 0 | 16,826,593 |
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <sstream>
#include<set>
#include<stack>
using name... | #include <iostream>
using namespace std;
int main() {
int n, result = 0;
cin >> n;
string s[n];
for (int i = 0; cin >> s[i]; i++) {
}
for (int b = 0; b < n; b++) {
bool symetric = true;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (s[... | 0 | 44,550,411 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define phi 3.1415926535
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
using namespace std;
const ll mo... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
using names... | 0 | 79,652,501 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int num = K;
for (int i = 0; i < N - 1; i++) num *= K - 1;
cout << num << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL mod = 1e9+7;
int main() {
int N;
cin >> N;
vector<LL> ... | 0 | 42,558,442 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> num(1e6+5,0);
vector<int> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A.begin(),A.end());
for(int i=0;i<N;i++){
int a=A[i];
if(num[a]>=2){
continue;;
}
while(a<=1e6... | #include <iostream>
using namespace std;
void solve()
{
int sum1 = 0;
int sum2 = 0;
for(int i = 0; i < 4; ++i)
{
int temp;
cin >> temp;
sum1 += temp;
}
for(int i = 0; i < 4; ++i)
{
int temp;
cin >> temp;
sum2 += temp;
}
if(sum1 >= sum2)
{
cout << sum1 << endl;
}
else
{
cout << sum2 << endl;... | 0 | 27,623,377 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll sum = 0;
sum += (b / c - (a - 1) / c) + (b / d - (a - 1) / d) - (b / lcm(c,d) - (a - 1) / lcm(c,d));
cout << (b-a+1)-sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
using ll... | 0 | 20,215,781 |
#include <bits/stdc++.h>
using namespace std;
template<class T>
bool chmax(T& a, const T& b) {
if (a < b) { a = b; return true; }
return false;
}
template<class T>
bool chmin(T& a, const T& b) {
if (b < a) { a = b; return true; }
return false;
}
template<typename T>
vector<T> make_v(size_t a) { return v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
int count_k = 0;
cin >> A >> B;
for(int i = A; i < B+1; i++){
int n1,n2,n3,n4,n5;
n1 = i % 10;
n5 = i / 10000;
if(n1 != n5){
continue;
}else{
n4 = i / 1000 - n5 * 10;
n2 = (i % 100) / 10;
if(n2 == n... | 0 | 23,326,021 |
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
#define INF 1e18
#define PI 3.141592653589793238
typedef long long ll;
#define N 200010
int main() {
int a,b;cin>>a>>b;
int ans=1;
while(ans<1010){
if(floor(ans*0.08)==a && floor(ans*0.1)==b) b... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=1100;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
const int Log=40;
int p2[Log];
char mp[4]={'U','D','R','L'};
int n;
int x[maxn],y[maxn];
int Abs(int x)
{
if(x<0) return -x;
return x;
}
int check()
{
for(int i=2;i<=n;i++)
{
if(Abs(... | 0 | 60,637,941 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<ll>
#define mii map<ll,ll>
#define... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 3,165,536 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
bool exist = false;
int k = 1;
while(k*(k-1) <= 2*N) {
if(k*(k-1) == 2*N){
exist = true;
break;
}
k += 1;
}
if(exist) {
cout << "Yes"... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main()
{
string line;
while (getline(cin, line)) {
if (line.find_first_of("\n") != string::npos)
line.erase(line.end()-1);
if (line.find_first_of("\r") != string::npos)
line.erase(line.end()-1);
if (line == ".")
... | 0 | 69,825,330 |
#include <iostream>
#include <stack>
#include <string>
using namespace std;
bool solve(string s) {
stack<char> st;
for (string::iterator i = s.begin(); i != s.end(); i++) {
switch (*i) {
case '(':
st.push('(');
break;
case ')':
if (... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <limits>
#include <queue>
#include <unordered_map>
#include <list>
#include <set>
using namespace std;
using ll = long long;
#define rep_init(i, init, n) for(in... | 0 | 90,098,158 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1... | #include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#pragma GCC optimize("Ofast")
#define rep(i, n) for(int i = 0; i < (n); ++i)
... | 0 | 70,643,050 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int flag;
int x,y;
cin>>x>>y;
if((y-2*x)<0)
{
flag=0;
}
else if((y-2*x)%2!=0)
{
flag=0;
}
else
{
int b=(y-2*x)/2;
if(0<=b&&b<=x)
{
flag=1;
}
else
{
flag=0;
}
}
if(flag)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
} | #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 | 86,056,605 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
ll ans = 0;
int tmp;
int n;
cin >> n;
map<int, int> o, e;
REP(i, n){
cin >> tmp;
if(i %2 == 0) e[tmp... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll N=1e6+5,inf=1e18,mod=1e9+7;
#define test ll testcases;cin>>testcases; while(testcases--)
#define lp(var,start,end) for (ll var = start; var <end ; ++var)
#define rlp(var,start,end) for(ll var = start; var>=end ; var--)
#... | 0 | 5,682,404 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <map>
#include <queue>
#include <stack>
#include <set>
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define P_B push_back
#define PO_B pop_b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int K_MAX = 100002;
int k;
ll a[K_MAX];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> k;
for(int i = 1; i <= k; i++)
cin >> a[i];
a[0] = 1;
ll mi = 2;
for(int i = k; i >= 1;... | 0 | 91,763,809 |
#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;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, vector<Q_temp>, greater<Q_temp>>;
const ll MOD = (ll)(1e9 + 7);
const int INF = (int)1e9;
const ll... | 0 | 79,111,108 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(long long i=x;i<y;i++)
typedef long long ll;
using namespace std;
int main()
... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long A,B,K;
cin >> A >> B >> K;
if (K <= A) {
A -= K;
} else if (K > A && K <= A+B) {
B -= K-A;
A = 0;
} else {
A = 0;
B = 0;
}
cout << A << " " << B << endl;
return 0;
} | 0 | 64,188,761 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | 0 | 54,905,045 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m,x;
... | 0 | 55,415,275 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | #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>;
#define FOR(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(x) *min_eleme... | 0 | 69,310,552 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> count;
vector<int> unique_num;
vector<int> bu(100001, 0);
for(int n=0; n<N; n++) {
cin >> A[n];
if(bu[A[n]]==0) {
unique_num.push_back(A[n]);
... | 0 | 51,999,758 |
#include<bits/stdc++.h>
#include<iostream>
#include<queue>
#include<string>
#include<algorithm>
using namespace std;
int n;
long long ans;
int main()
{
cin>>n;
ans=(n*800)-(n/15)*200;
cout<<ans<<"\n";
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<tuple>
#include<ctime>
#include<functional>
#include<cmath>
#include<cassert>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> p;
#define rep(i,n) for(ll i=0;i<(n)... | 0 | 86,743,688 |
#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... | #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 | 43,303,542 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | #include<bits/stdc++.h>
#define ll long long
#define db double
#define lowbit(p) (p&(-p))
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define A first
#define B second
using namespace std;
void read(int &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=g... | 0 | 89,119,265 |
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using Graph = vector<vi>;
using P = pair<int,int>;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const l... | 0 | 35,269,981 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<cstring>
#include<bitset>
#include<stack>
#include<time.h>
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define scd(a) scanf("%d",&... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,start,end) for(int i=start;i<=end;i++)
const int INF = 1001001001;
using namespace std;
typedef long long ll;
int main()
{
int K;
cin >> K;
vector<ll> a;
FOR(i, 1, 9) a.push_back(i);
int count = 0;
while(1) {
if(a.size() >= K) ... | 0 | 68,555,130 |
#include<bits/stdc++.h>
using namespace std;
char n[100][100];int k[100][100],l[100][100],sum,H,W,i,j,m,s;
#define A(B,C) if(k[B][C]!=1){l[B][C]=1;}
int main(){while(true){s=0;memset(l,0,sizeof(l));cin>>W>>H;if(W==0){break;}for(i=1;i<=H;i++){for(j=1;j<=W;j++){cin>>n[i][j];if(n[i][j]=='.'){k[i][j]=0;}else if(n[i][j]=='@... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
template <typename T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {... | 0 | 74,607,975 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.