code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int S1 = s.size(), T1 = t.size();
vector<char> S(S1), T(T1);
for (int i = 0; i < S1; i++) {
S.at(i) = s.at(i);
}
for (int i = 0; i < T1; i++) {
T.at(i) = t.at(i);
}
sort(S.begin(), S.end());
sort(T.beg... | #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>;
const int INF = 1 << 30;
int main() {
string s;
ll k;
cin >> s >> k;
int count1 = 0;
char c;
rep(i, s.size()) {
if (s[i] == '1') count1++;
else {
c = s[i];
break;... | 0 | 84,144,432 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
template<typename T>
void test(T a){
return ;
}
signed main(){
int a[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k; cin >> k;
cout << a[k-1] << endl;
} | #include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
const ll maxsize = 100000009;
void solve() {
int n, k;
cin >> n >> k;
ll sum = 0;
for(int i = 0; i < k; ++i) {
int x;
cin >> x;
sum += x;
}
if(sum < n) cout << "N... | 0 | 26,783,252 |
#include<bits/stdc++.h>
using namespace std;
int r;
long long int d[205][205];
int x[8],y[8];
long long int ans=1e18;
void solve(int num,long long int tmp){
if(num==r || tmp>ans)ans=min(ans,tmp);
if(num==0){
for(int i=0;i<r;i++){
y[0]=i;
solve(1,0);
}
}
else{
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for (... | 0 | 27,444,572 |
#include <bits/stdc++.h>
int main() {
uint64_t N, M;
std::cin >> N >> M;
const uint64_t all = N * M;
uint64_t ans = 0;
if (N == 1) {
if (M == 1) {
ans = 1;
} else {
ans = all - 2;
}
} else if (M == 1) {
if (N == 1) {
ans = 1;
... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | 0 | 16,764,305 |
#include<bits/stdc++.h>
using namespace std;
int N;
int solve() {
vector<int>a(N);
for(int i=0;i<N;i++){
cin >>a.at(i);
}
sort(a.begin(),a.end());
int sum=0;
for(int i=1;i<N-1;i++) {
sum +=a.at(i);
}
return sum/(N-2);
}
int main(){
while(cin >> N && N>0) {
cout <<... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <tuple>
#include <map>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <limits>
#include <unordered_map>
#include <map>
#include <cmath>
using namespace std;
typedef long long... | 0 | 77,884,652 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll count(string &S) {
ll x = 0;
int even = 1;
rep(i,S.size()-1) {
if (S.at(i) == S.at(i + 1)) {
if (even == 1) ++x;
even *= -1;
... | #include <bits/stdc++.h>
using namespace std;
int N, K;
int main()
{
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
vector<int> bucket(202020);
for (int i = 0; i < N; i++)
{
bucket[A[i]]++;
}
sort(bucket.begin(), bucket.end());
r... | 0 | 92,946,557 |
#include <iostream>
#include <numeric>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int n, input;
while (true) {
cin >> n;
if (n == 0) { break; }
vector<int> scores;
for (int i = 0; i < n; i++) {
cin >> input;
scores.push_back(input);
}
cout << (accumu... | #include<bits/stdc++.h>
#include<boost/variant.hpp>
using namespace std;
typedef long long ll;
typedef vector<boost::variant<bool, ll, int, string, double, char*, const char*>> any;
template<typename T> inline void pr(const vector<T> &xs){
for(int i=0; i<xs.size()-1; i++) cout<<xs[i]<<" ";
(xs.empty()?cout:(cout<<xs[... | 0 | 17,503,962 |
#include <bits/stdc++.h>
#define cn count
#define pb push_back
#define in insert
#define fs first
#define sc second
#define sz size
#define len length
#define forn(i, n) for (ll i = 0; i < (ll) (n); ++i)
#define forni(i, n) for (ll i = 1; i < (ll) (n); ++i)
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.... | #include<iostream>
#include<map>
#include<vector>
using namespace std;
int main() {
int N;
cin>>N;
map<int, int> primemap;
vector<int> primearr;
int tmp;
for(int i=2;i<=N;++i){
tmp = i;
for(int j=2;tmp>1;++j){
while(tmp%j==0){
if(primemap[j]==0)primear... | 0 | 71,207,704 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
ll H, W;
cin >> H >> W;
if(H == 1){
cout << 1 << endl;
return 0;
}
if (W == 1) {
cout << 1 << endl;
return 0;
}
if (W % 2 == 0 && H % 2 == 0) {
cout << W * H / 2 << endl;
}
else if(W % 2 ==... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<functional>
#include<map>
#include<cstring>
#define p pair<int,int>
#define P pair<int,p>
using namespace std;
P a[100000];
int Par[10000], Rank[10000];
int saiki(int b) {
if (Par[b] == b)return b;
retur... | 0 | 33,201,193 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll h[303];
ll dp[303][303];
const ll INF = 1e17;
int main() {
int n,k;
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> h[i];
for(int i = 0; i <= n; i++) {
for(int j = 0; j <= n; j++) {
dp[i][j] = IN... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll,ll>
#define vvll vector< vector<ll> >
#define pb push_back
#define sz(v) (v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(),(v)... | 0 | 85,084,892 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putch... | #include <bits/stdc++.h>
template <class T>
T pow(T x, T n, T mod) {
T ret = 1;
while(n > 0) {
if ((n & 1) == 1) ret = (ret * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return ret;
}
template <class T>
T inverse(T x, T p) { return pow(x, p - 2, p); }
int main() {
constexpr auto ... | 0 | 11,869,109 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 un... | #include <stdio.h>
#include<math.h>
#include<stdbool.h>
#include<string.h>
typedef long long lint;
int i,j;
int dp[5050][5050]={};
#define INF (1<<30)
int main(void){
char S[5050],T[5050];
scanf("%s",S);
scanf("%s",T);
int N=strlen(S),K=strlen(T);
for(i=0;i<=N;i++) dp[i][0]=i;
for(i=0;i<=K;i++) ... | 0 | 97,222,982 |
#include <iostream>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3 = y1 - y2 + x2, y3 = x2 - x1 + y2;
int x4 = y2 - y3 + x3, y4 = x3 - x2 + y3;
printf("%d %d %d %d", x3, y3, x4, y4);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
const ll MOD=1000000007LL;
int main(){
ll N;
string S;
cin >> N >> S;
ll ans = 1;
ll cnt = 0;
FOR(i,0,2*N){
if( (cnt%2==0&&S[i]=='B') || (cnt%2==1&&S[i]=='W') ){
cnt++;
}else{
(ans *=... | 0 | 30,827,120 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin>>A>>B;
int sum=-1;
for(int i=1;i<1500;i++){
int a=i*0.08;
int b=i*0.1;
if(a==A&&b==B){
sum=i;
break;
}
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 90,586,281 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <set>
#include <map>
#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
using namespace std;
int main()
{
int num = 0;
while (cin... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#d... | 0 | 66,784,409 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int x,y,z;
cin >> x >> y >> z;
string ans = (x < y) ? (y < z) ? "Yes" : "No" : "No";
cout << ans << endl;
return 0;
} | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int N,M,P,sum,winner;
while(cin>>N>>M>>P){
if(N==0 && M==0 && P==0){
break;
}
sum=0;
winner=0;
for(int i=1;i<=N;i++){
int temp=0;
cin>>temp;
if(M==i){
winner=temp;
}
sum=sum+temp;
}
if(winner!=0){
sum=(su... | 0 | 75,572,394 |
#include <iostream>
#include <algorithm>
using namespace std;
int a[4];
int x[4]={1,4,7,9};
int main(){
for(int i=0;i<4;i++)cin>>a[i];
sort(a,a+4);
for(int i=0;i<4;i++){
if(a[i]!=x[i]){
cout<<"NO\n";
return 0;
}
}
cout<<"YES\n";
return 0;
} | #include <bits/stdc++.h>
#define N 110
using namespace std;
int A[N];
int dp[N][N];
int Min(int &a,int b){return a = min(a,b);}
int main(){
int n;
cin>>n;
for(int i=0,cnt=0;i<n;i++){
int a,b;
cin>>a>>b;
if(i == 0) A[cnt++] = a;
A[cnt++] = b;
}
for(int i=0;i<N;i++){
for(int j=0;j<N;j++)dp[i... | 0 | 43,052,714 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using li = long long int;
using uli = unsigned long long int;
using namespace std;
int main() {
fastIO;
string s;
cin >> ... | 0 | 5,533,826 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define mp make_pair
#define fi first
#define se second
int main()
{
int n;cin >> n;
vector<pair<int,int>> matrix(n);
int a,b;
for (int i=0;i<n;i++)
{
cin >> a >> b;
matrix[i]=mp(a,b);
}
vector<vector<pair<in... | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 2e5 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
ll a[N];
int main () {
ios::sync_with_stdio(0), cin.... | 0 | 85,995,251 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define ld long double
#define lll __int128
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int> >
#define ... | 0 | 1,980,796 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long int lli;
string charset[10][5] = {
{},
{".", ",", "!", "?", " "},
{"a", "b", "c"},
{"d", "e", "f"},
{"g", "h", "i"},
{"j", "k", "l"},
{"m", "n", "o"},
{"p", "q", "r",... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | 0 | 52,863,047 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> Number(200000,0);
for(ll i=0;i<N;i++){
cin >> A.at(i);
Number.at(A.at(i)-1)++;
}
ll Sum;
for(ll x:Number){
if(x!=0){
Sum+=x*(x-1)/2;
}
}
for(ll k=0;k<N;k... | #include <bits/stdc++.h>
using namespace std ;
int main()
{
int x;
cin>>x;
long long a[x];
long long s=0;
for(int i=0;i<x;i++)
{
cin>>a[i];
if(i>0&&a[i-1]>a[i])
{
s =s+a[i-1]-a[i];
a[i]=a[i-1];
}
}
cout<<s;
return 0 ;
} | 0 | 67,880,523 |
#include <iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
if (a < b)
if (b < c) cout << "Yes" << endl;
else cout << "No" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <string>
#include <queue>
using namespace std;
int main(){
int w,h;
int data[30][30];
int flag[30][30];
int dx[4] ={0,1,0,-1};
int dy[4] ={1,0,-1,0};
while(1){
cin>>w>>h;
if(w==0 && h==0)break;
for(int i=0;i<30;i++){
for(int j=0;j<30;j++){
data[i][j]=-1;
flag[i][j]=0;
}... | 0 | 88,791,104 |
#include<bits/stdc++.h>
using namespace std;
int init = 0;
bool sl = true;
vector<vector<int> > tree;
vector<long long> pesos;
vector<int> visto;
long long sol(int ver){
visto[ver] = 1;
long long count = 0;
long long val = 0;
vector<long long> vecVal;
for(int i = 0; i < tree[ver].size(); i++){
if(visto[tree[ver]... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define hell 1000000007
#define PI 3.14159265358979323846
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
while(t--)
{
ll k,x;
cin>>k>>x;
if(500*k>=x)
... | 0 | 60,835,551 |
# include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | #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;
#define mp make_pair
#define pb(x) push_back(x)
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define vs vector... | 0 | 81,377,279 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll modi = 1e9+7;
ll binpow(ll a,ll b){
ll res =1;
while(b>0){
if(b&1)
res = res*a%modi;
a= a*a%modi;
b>>=1;
}
return res;
}
int main(){
ll n,k;
cin >> n >>k;
ll dp[k+1];
memset(dp,0,sizeof(dp));
for(ll i =k;i>0;--i){
ll to_mak... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
ll N;
vector<ll> A;
bool solve() {
ll sum = 0;
for (int i = 0; i < N; ++i) sum += A[i];
ll num = sum / (N * (N + 1) / 2);
if (sum... | 0 | 55,642,323 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
void solve(void)
{
int n;
cin >> n;
vector<int> a(n + 2);
rep(i, n) cin >> a[i + 1];
a[0] = 0, a[n + 1] = 0;
int res = 0;
rep(i, n + 1) res += abs(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 73,861,255 |
#pragma once
#include <stdio.h>
#include <string>
#include <iostream>
#include <queue>
using namespace std;
string S[1001];
long result=0;
int H,W,N;
long minmytime[1000][1000];
queue<int> qx,qy,mytime;
int sx,sy,gx,gy;
int step = 0;
int main(){
scanf("%d%d%d",&H,&W,&N);
for(int i=0;i<H;i++){
cin>>S[i];
for(int j... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int a,b,c,d;
cin >> a >> b >> c >> d;
int abd = abs(a-b);
int bcd = abs(b-c);
int acd = abs(a-c);
if(d >= acd){
... | 0 | 70,569,798 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n,c=0,t,a,b,s;
cin>>a>>b>>c;
n = c-b;
if(c-b <= 0)
{
cout<<"delicious\n";
}
else if(n <= a)
{
cout<<"safe\n";
}
else
{
cout<<"dangerous\n";
}
} | #include <bits/stdc++.h>
using namespace std;
void __start__() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MY
freopen("/home/ainur/CLionProjects/wow/input.txt", "r", stdin);
freopen("/home/ainur/CLionProjects/wow/output.txt", "w", stdout);
#else
#define endl '\n'
#endif
}
#define sz(x... | 0 | 32,491,621 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin >> a >> b >> c >> d;
if((a+b) > (c+d)){
cout << "Left" << endl;
}
else if((a+b) == (c+d)){
cout << "Balanced" << endl;
}
else{
cout << "Right" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD =ll(1e9) +7;
int main() {
string S;
cin >> S;
ll dp[S.size()+1][2] ={};
dp[0][0] =1;
for(int i=0;i<S.size();i++){
dp[i+1][0] = dp[i][0];
dp[i+1][1] = dp[i][1];
dp[i+1][1] *=3;
int t = S[i] ... | 0 | 74,882,593 |
#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
const int INF=mod;
const double PI=3.14159265358979323846;
using ll = long long;
using P=pair<int, int>;
using vl=vector<long long>;
using vvl=vector<vector<long long>>;
using vP=vector<pair<long long, long long>>;
#define rep(i,n) for(int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
using ll = long long;
using Grid = vector<vector<int>>;
using vi = vector<int>;
int main() {
... | 0 | 39,185,208 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define loop(i,n) rep(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n,k;
cin >> n >> k;
vector<ll> a(n),sum_a(n+1,0),sum_aplus(n+1,0);
loop(i,n)cin >> a[i];
rep(i,1,n+1)sum_a[i]=sum_a[i-1]+a[i-1];
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 0 | 84,933,671 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
vector<int> v1, v2;
char s[8010];
int l, x, y;
bool d[2][18001];
int p=9000;
bool pos(vector<int>& v, int n) {
if(v.empty()) return n==0;
if(n+p<0 || n+p>18000) return false;
memset(d,0,sizeof(d));
d[1][p]=1;
int from=1, to=0;
for(int i... | 0 | 74,711,662 |
#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;cin>>N;
long a; long res = 0;
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
#define ll long long
int main()
{
multiset<ll> st;
ll n, m;
cin >> n >> m;
for (ll i = 0; i < n; i++)
{
ll a;
cin >> a;
st.insert(a);
}
for (ll i = 0; i < m; i++)
{
... | 0 | 27,153,118 |
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
int main(){
int k,a,b;
cin>>k;
cin>>a;
cin>>b;
int x=b/k;
int y=x*k;
if(y>=a && y<=b)
cout<<"OK";
else
cout<<"NG";
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define M 1000000007
using namespace std;
ll n,t,m,x,y,q;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin>>n;
ll a[n],x=1,ans=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]==x)x++;
else ans++;
}
if(an... | 0 | 5,696,245 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int V, E;
ll cost[105][105];
ll INF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> V >> E;
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (i == j) cost[i][j] = 0;
else cost[i][j] = INF;
... | #include<bits/stdc++.h>
#include <cctype>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define ld long double
#define PRY cout<<"YES\n"
#define PRN cout<<"NO\n"
#define SETP(sp) fixed<<setprecision(sp)
#define PB pus... | 0 | 97,495,649 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(ll (i)=0; (i)<(n); ++(i))
#define pr... | #include <cstring>
#include <cassert>
#include <utility>
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <functional>
#include <tuple>
#include <climits>
#include <limits>
#include <deque>
#include <list>
#include <array>
#include <stack>
#include... | 0 | 56,785,638 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
const int N = 2e5+5, M = 1e6+6, OO = 0x3f3f3f3f;
int h,w, m;
set<pair<int, int> > st;
map<int, ll> ros, cols;
int main()
{
FIO
cin>>h>>w>>m;
for(int i = 0 ; i<m ; i++)
{
int ... | 0 | 29,427,966 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namesp... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int N; cin>>N;
vector<int> vW(N);
int total=0;
rep(i,N){
int x; cin>>x;
total += x;
vW[i]=x;
}
int ans = 1e9;
int left = 0;
for(int i=0; i<... | 0 | 39,653,456 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int H,W,K;cin>>H>>W>>K;
char A[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++) cin>>A[i][j];
}
int ans=0;
for(int s=0;s<(1<<H);s++){
for(int t=0;t<(1<<W);t++){
int black=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
class Dictionary{
const int MAX = 1000003;
vector<int> D;
int get_key(char c) {
if (c == 'A') return 1;
if (c == 'C') return 2;
if (c == 'G') return 3;
return 4;
}
int keta(int N) {
int ... | 0 | 100,761,018 |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
#define int ll
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, m;... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | 0 | 85,356,822 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli q, h, s, d, n;
int main(void){
cin >> q >> h >> s >> d >> n;
lli x = min({4*q, 2*h, s});
lli y = d;
lli ans = 0;
if(2*x > y){
ans = n/2*y+n%2*x;
}else{
ans = n*x;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | 0 | 82,278,159 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define LL long long
#define MAXN 300000
int n,cnt[MAXN+5],ans[MAXN+5];
LL sum[MAXN+5];
LL read(){
LL x=0,F=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')F=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*... | #include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_b... | 0 | 53,695,766 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <com... | #include<iostream>
#include<algorithm>
#include<cstring>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main()
{
int a[100];
memset(a,0,sizeof(a));
int in;
while(cin>>in)a[in-1]++;
vector<pair<int,int>> P;
rep(i,100)P.push_back(make_pair(a[i],i));
sort(P.begin(),P.end(),[](const pair<int,int> p... | 0 | 119,766 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#define MAX_L (1010)
using namespace std;
int q;
int dp[2][MAX_L];
int main()
{
scanf("%d", &q);
for ( int i = 0; i < q; i++ ) {
string a, b;
char str[MAX_L];
scanf("%s", str);
a = str;
scanf("%s", str);
b = str;
memset(dp, 0, ... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define rep(i,n) for(ll i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(ll i=num, i##_len=(n); i<i##_len; ++i)
#define repprev(i,a,b) for(ll i=b-1;i>=a;i--)
#define reprev(i,n) repprev(i,0,n)
using namespace std;
#define sz(x)... | 0 | 49,778,280 |
#include <iostream>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <vector>
using namespace std;
void solver() {
int my=0,n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
my+=arr[i];
}
int var,var1;
var=my/n;
var1=var+1;
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, std::string s, std::string t) {
rep(i, N) {
string subs = s.substr(i);
if (t.find(subs) != t.npos) {
cout << (s.substr(0, N - subs.length()) + t... | 0 | 7,060,316 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=(b-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x) x.begin(),x.end()
... | 0 | 77,188,405 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main(){
long long n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
long long ans = 0;
int maxi = 0;
rep(i,n){
maxi = max(maxi,a[i]);
int Bi = maxi;
ans += Bi - a[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | 0 | 98,974,822 |
#define _GLIBCXX_DEBUG
#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,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | 0 | 26,527,484 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<double> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
double ans = a[0];
for(int i = 1; i < n; i++) {
ans = (ans + (double... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll A,B,K;
cin >> A >> B >>K;
ll num =0;
for(int i=100;i>=0;--i){
if(A%i ==0 && B%i==0){
num++;
}
if(num == K){
cout << i << endl;
return 0;
}
}
retur... | 0 | 99,209,557 |
#include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
int main()
{
abc_154a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout << "Yes\n";
else cout << "No\n";
}
void abc_151a()
{
char C;
cin >> C;
cout << (char... | #include <stdio.h>
#include <string.h>
int main() {
int A,B;
char S[20];
int C, counts = 0;
scanf("%d %d", &A, &B);
scanf("%s", S);
C = strlen(S);
if(!(S[A] == '-')){
printf("No");
return 0;
}
for(int i=0;i<C;i++){
if(S[i] == '-'){
counts++;
... | 0 | 62,517,565 |
#include <bits/stdc++.h>
using namespace std;
void init(){
cin.tie(0);
cin.sync_with_stdio(0);
}
#define ll long long
#define ld long double
#define ull unsigned long long
#define ull unsigned long long
#define mod 1000000007
#define pi (3.1415926)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(ll i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#de... | 0 | 48,030,931 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
template <typename T>
using V = vector<T>;
template <typename T, type... | 0 | 53,651,233 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vector<ll>red(a);
vector<ll>green(b);
vector<ll>no(c);
for(int i=0; i<a; i++)
cin>>red[i];
sort(red.rbegin(),red.rend());
for(int i=0; i<b; i++)
cin>>green[i];
sort(green.rbegin(),green.rend())... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<math.h>
#include<cstring>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k,a,b;
cin>>k>>a>>b;
int i=0;
for(i=a;i<=b;i++)
{
if(i%k==0)
... | 0 | 85,565,589 |
#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 62,804,853 |
#include <bits/stdc++.h>
using namespace std;
struct Mat{
int r,l;
};
int main(){
int n; cin >> n;
vector<Mat> Mats(n);
for(int i=0; i<n; i++)
cin >> Mats[i].r >> Mats[i].l;
int dp[n][n] = {};
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
if(i==j) dp[i][j] = 0;
else dp[i][j] = INT_MA... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 29,068,288 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int d[n];
for (int i=0; i<n; i++) {
cin >> d[i];
}
sort(d, d+sizeof(d)/sizeof(d[0]));
cout << d[n/2] - d[n/2 - 1] << endl;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n... | 0 | 18,154,521 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int freq[26];
int main(){
string str;
while(cin >> str){
for(char c: str){
if(isalpha(c)) freq[tolower(c)-'a']++;
}
}
for(int i=0; i<26; i++){
cout << (char)(i+'a') << " : " << freq[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
#define rep(i, r) for(int i = 0; i < (int)(r); i ++)
vector< ll > divisor(ll n) {
vector< ll > ret;
for(ll i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_ba... | 0 | 69,156,742 |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define vll vector<ll>
using namespace std;
int main(){
ios_base::sync_with_stdio(true);
cin.tie(NULL);
ll n, ans = 1, a;
cin >> n;
vll x;
for(ll i=0; i<n; i++){
cin >> a;
x.push_back(a);
}
ll mini = ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | 0 | 46,824,751 |
#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 for1(i, m, n) for(int i = m;i < n;i++)
#define ll long long
#define endl '\n'
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (... | #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 | 10,956 |
#include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1e9;
int s[200010];
int dp[200010];
int hsh[1 << 26];
int main() {
string _s; cin >> _s;
int n = _s.size();
for(int i = 1; i <= n; ++i) {
s[i] = s[i - 1] ^ (1 << (_s[i - 1] - 'a'));
dp[i] = INF;
}
for(int i = 0; i < (1 << 26); ++i) {
hsh[i] = ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 46,747,703 |
#include <iostream>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
cout<<(a>8||b>8?":(":"Yay!")<<endl;
} | #include<iostream>
using namespace std;
int main(){
int n,m,p;
while(cin>>n>>m>>p){
if(n==0)break;
double G=0;
int num[n];
for(int i=0;i<n;i++){
cin>>num[i];
G+=num[i];
}
G*=(100.0-p);
if(num[m-1]!=0){
cout << (int)(G/num[m-1]) << endl;
}else{
cout << 0 << end... | 0 | 24,517,216 |
#include<iostream>
#include<string>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
int i;
for(i=0; i<h; i++){
string s;
cin >> s;
cout << s << endl;
cout << s << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <cstdio>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i =... | 0 | 34,532,834 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a<10)cout<<b+100*(10-a)<<endl;
else cout<<b<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, L;
cin >> n >> L;
vector <int> a(n);
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
bool good... | 0 | 12,821,079 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
int seen[10000][10000];
char S[10000][10000];
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i != 0)
{
continue;
}
i... | #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<int,int> P;
LL mod=1000000007;
LL LINF=1LL<<60;
const int INF=1<<30;
i... | 0 | 5,378,674 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int a[1001],b[1001];
int main()
{
int n,i,x,y,sum=0;
cin>>n>>x>>y;
for(i=1;i<=n;i++)
{
cin>>a[i]>>b[i];
}
for(i=1;i<=n;i++)
{
if(a[i]>=x&&b[i]>=y) sum++;
}
cout<<sum;
return 0;
} | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define MAXN 300003
#define MOD 1000000007
#define oo (1<<20)
#define mid ((a+b)/2)
#define pb push_back
#define sz size()
#define fastCpp() ios_base::sync_with_stdio( false ), cin.tie( NULL ), cout.tie( NULL )
using namespace std;
typedef long long ll;
typedef unsig... | 0 | 28,518,485 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000001
int main(){
int N;
cin>>N;
vector<int> A(N+1,0);
for(int i=1;i<=N;i++)cin>>A[i];
int ok = 200001;
int ng = 0;
while(ok-ng>1){
int mid = (ok+ng)/2;
bool f = tr... | #include <bits/stdc++.h>
# define ll long long
# define vi vector<int>
# define pii pair<int,int>
#define mp make_pair
#define pb push_back
# define PI acos(-1)
# define double long double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL) ;
double a,b,x ;
cin >> a >> b >> x ;
d... | 0 | 53,951,611 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
vector<int> low, med, hig;
for(int i = 0; i < n; i++){
int p;
cin >> p;
if(p <= a) low.push_back(p);
else if(b+1 <= p) hig.push_back(p);
else med.push_back(p);
}
cout << min({low.size(), med.size(),... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
#define pb push_back
#define fi first
#define be begin()
#define en end()
#define se second
using ll = long long;
using namespace std;
using pint = pair<int,int>;
using pll = pair<l... | 0 | 17,250,790 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x;
cin >> x;
while( (x%100) > 5){
x = x - 105;
}
if(99 < x){
cout << 1 << endl;
}
else if(x < 100){
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 78,098,377 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | 0 | 93,558,799 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string ... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef l... | 0 | 93,647,820 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 0 | 45,041,106 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
while(1){
int n, m, c = 0;
string h, r, a, str;
vector<string> vec, ch;
vector<string> ango;
cin >> n;
if(n == 0)break;
for(int i = 0; i < n; i++){
cin >> h >> r;
vec.push_back(h);
ch.p... | #include <cstdio>
#include <random>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <chrono>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <bitset>
#define pb push_back
#define mk make_pair
#define eb emplace_bac... | 0 | 44,753,148 |
#include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn=1e5+10,mod=1e9+7;
const ll inf=1e18;
pair<ll,int> p[maxn];
map<ll,vect... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int a,b,k,br=0;
cin >> a >> b >> k;
for (int i=min(a,b);i>=1;i--)
{
if(a%i==0 && b%i==0)
br++;
if(br==k)
{
cout << i;
return 0;
... | 0 | 45,867,173 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
ll beki(ll f,ll n... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 20,752,185 |
#include<iostream>
using namespace std;
#define MAX 100000
struct Node{
int parent,left,right;
};
Node T[MAX];
int D[MAX],s;
int get_depth(int u, int p){
D[u]=p;
if(T[u].right != -1){
get_depth(T[u].right,p);
}
if(T[u].left != -1){
get_depth(T[u].left,p+1);
}
}
void array_init(No... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> P;
struct pos {
int row;
int column;
};
#define rep(i, n) for ... | 0 | 7,378,630 |
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
using namespace std;
int n;
string str;
int main(void){
while(1){
scanf("%d",&n);
if(n==0)break;
bool left=false,right=false,lr=false;
int cnt=0;
for(int i=0;i<n;i++){
cin >> str;
if(str=="lu")left=true;
if(str=="ru")right=tr... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | 0 | 75,523,813 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int X,Y,x,c;
cin >> X >> Y;
c=Y/2;
x=X+c;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 0 | 2,754,207 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<=(n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
int main(){
string s;
cin>>s;
sort(all(s));
string t="abcdefghijklmnopqrstuvwxyz";
rep(i,26){
bool ja=true;
rep(j,s.length()){
if(s[j]==t[i]){
ja=... | #include <bits/stdc++.h>
using namespace std;
#define ri register int
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *i... | 0 | 67,027,742 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
con... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int A[9];
for (int i = 0; i < 9; i++) cin >> A[i];
int N;
cin >> N;
int b[N];
for (int i = 0; i < N; i++) cin >> b[i];
bool bingo[9] = {false};
for (int i = 0; i < 9; i++) {
for (int j = 0; j < N; j++) {
if (A... | 0 | 13,310,409 |
#include <iostream>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
if(a>=b)
cout<<"10";
else
cout<<"0";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
int main(int argc, char const *argv[])
{
std::string line;
std::vector<int> res(26,0);
while(true){
std::getline(std::cin,line);
if(std::cin.eof()){break;}
for(char c : line){
int cn = (int)c;
if(cn >= (int)'a'){
cn -= (int)'a';
}else{
cn... | 0 | 49,449,682 |
#include<bits/stdc++.h>
#define de(x) cout<<#x<<"="<<x<<endl
#define dd(x) cout<<#x<<"="<<x<<" "
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define repd(i,a,b) for(int i=a;i>=(b);--i)
#define repp(i,a,b,t) for(int i=a;i<(b);i+=t)
#define mt(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp(u,v) ma... | #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 (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 95,554,019 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 0 | 34,933,313 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
int dp[n][3];
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i] >> c[i];
}
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0]... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 0 | 59,303,359 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> G(8,vector<int>(8));
int ans;
int n, m;
int main(void){
cin >> n >> m;
for(int i = 0; i < m; i++){
int a, b;
cin >> a >> b;
a--,b--;
G[a][b]++;
G[b][a]++;
}
ans = 0;
vector<in... | #define _USE_MATH_DEFINES
#include<bits/stdc++.h>
#define nl cout<<"\n";
#define ll unsigned long long int
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const ll mod=1e18;
int main()
{
IOS
ll n;
cin>>n;
ll p=0;
for(ll i=2;i<=sqrt(n);i++)
{
ll cnt=0;
while(n%i==0)
{
cnt++;... | 0 | 31,989,291 |
#include<bits/stdc++.h>
using namespace std;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
int x,y;
cin>>x>>y;
string ans;
ans="No";
for(int i=1;i<=x;i++) {
int b;
b=x-i;
if((b*4+i*2)==y||(b*2+i*4)==y) {
ans... | #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 w, h, n;
cin >> w >> h >> n;
int x1 = 0, x2 = w, y1 = 0, y... | 0 | 99,685,227 |
#include <iostream>
using namespace std;
void pri(){
for(int i=0; i<20; i++) cout <<"#";
cout << endl;
}
int main(){
int n; cin >> n;
int m[5][4][11]={};
for(int i=0; i<n; i++){
int b,f,r,v;
cin >> b >> f >> r >> v;
m[b][f][r] += v;
}
for(int i=1; i<5; i++){
for(int j=1; j<4; j++){
... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 67,718,359 |
#include <stdio.h>
int score[1010][1010];
int max2 (int a, int b){
if (a >= b) return a;
else return b;
}
int len_of_str(const char s[]){
int num = 0;
while(s[num]) num++;
return num;
}
int main() {
char a[1100];
char b[1100];
int datanum;
scanf("%d",&datanum);
for(int c = 0; c < datanum; c++){
sc... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n;
vector<LL> edges[110000];
LL num[110000];
vector<LL> deg(110000, 0);
LL ok = 1;
void dfs(LL v, LL p){
if(deg[v] != 1) num[v] *= 2;
vector<LL> r;
for (LL x : edges[v]) {
if (x != p){
dfs(x, v);
num[v] -= num[x];
r.push_back(num[x]);
... | 0 | 83,712,231 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int m, f, r;
char grade;
while (1) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)
break;
if (m == -1 || f == -1) {
grade = 'F';
cout << grade << endl;
continue;
}
if (m + f >= 80) {
grade = 'A';
} else i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vec1;
typedef vector<string> vec2;
typedef vector<double> vec3;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
vec1 z(n);
for(int i = 0; i < n; i++) cin >> z.at(i);
vec1 b(m);
for(int i = 0; i < m; i++) cin >> b.a... | 0 | 39,002,770 |
#include<bits/stdc++.h>
#include<numeric>
using namespace std;
const long double PI = 3.141592653589793238;
const double EPS = 1e-6 ;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define dd double
#define vll vector<ll>
#define vs vector<string>
#define fn(i,n) for(ll i = 0; i<n; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
scanf("%d %d", &x, &y);
if (abs(x - y) > 1) {
printf("Alice\n");
} else {
printf("Brown\n");
}
} | 0 | 8,655,745 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<((int)(n));i++)
#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++)
#define... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 0 | 83,288,502 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > > minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popcoun... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
void f(string s,vector<int> &a){
vector<int> seen(26);
int p = 1;
rep(i,int(s.size())){
if(seen[s[i]-'a']){
a[i]=seen[s[i]-'a'];
}else{
seen[s[i]-'a'] = p;
... | 0 | 13,245,022 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
long long sum = 0LL;
vector <int> a(n);
for(int&i : a)
scanf("%d",&i) ,sum += i;
if((2*sum)%(n*(n+1LL))){
cout << "NO" << endl;
return 0;
}
int ops = 2*sum/n/(n+1) ,st = a[0];
fo... | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
#include <numeric>
using namespace std;
using ll = ... | 0 | 14,409,464 |
#include<stdio.h>
int main(){
char str[20];
scanf("%[^\n]",&str);
str[5]= ' ';
str[13]= ' ';
printf("%s", str);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 27,750,776 |
#include<iostream>
using namespace std;
int a[5000];
int b[5000][5000];
int main() {
int n;
while (cin >> n&&n != 0) {
int sum = -100000;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0) {
b[0][i] = a[i];
if (sum < b[0][i])
sum = b[0][i];
}
else {
b[0][i] = b[0][i - 1] + a[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 78,455,576 |
#include<iostream>
using namespace std;
int main(){
string s,t,m="mcxi";
int n,a,b,c,i,j,k;cin>>n;
for(i=0;i<n;i++){
cin>>s>>t;
a=b=0;
for(j=0;j<s.size();j++)
if('9'<s[j]){
for(k=3,c=1;k>=0;k--){
if(s[j]==m[k])break;
c*=10;}
if(j==0||'9'<s[j-1])a+=c;
else a+=c*(s[j-1]-'0');
}
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<ll,ll>;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1000000007;
int main(){
int R,G,B,n;
cin >> R >> G >> B >> n;
int ans = 0;
for(int i=0... | 0 | 29,831,604 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#define rg register
using namespace std;
template < typename T > inline void read(T& s) {
s = 0; int f = 0; char c = getchar();
while (!isdigit(c)) f |= (c == '-'), c = ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 0 | 17,650,211 |
#include <stdio.h>
int main(){
int N, A, B;
scanf("%d %d %d", &N, &A, &B);
int ans = 0;
for(int i = 1; i <= N; i++){
int temp = i;
int total = 0;
while(temp > 0){
total += temp % 10;
temp /= 10;
}
if(total >= A && total <= B){
ans += i;
}
}
printf("%d\n", ans);
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <math.h>
using namespace std;
const long long int INF = 1000000007;
int main(void)
{
long long N;
cin >> N;
if (N % 2 == 0)
{
... | 0 | 84,726,081 |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
typedef long long ll;
... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 32,142,501 |
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
string s; cin >> s;
ll k; cin >> k;
int ans=1;
for(int i=0; i<k; i++){
if(s.at(i)=='1') continue;
else{
ans = s.at(i) - '0';
break;
}
}
cout << ans << endl;
return 0... | #include <bits/stdc++.h>
#include <cmath>
#include <assert.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = LONG_LONG_MAX;
const ll MINF = -10e10;
#define cmin(x, y) x = min(x, y)
#def... | 0 | 97,177,240 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.