code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> c(m), results(n+1);
for (int i = 0; i < m; ++i)
cin >> c[i];
results[0] = 0;
for (int i = 1; i <= n; ++i)
{
results[i] = n + 1;
for (int j = 0; j < m; ++j)
{
if (i >= c[j])
{
int tmpCoin... | #include<bits/stdc++.h>
#define INF 999999999
using namespace std;
const int MAX_N = 50000;
const int MAX_M = 20;
int dp[MAX_M+1][MAX_N+1];
int c[MAX_N];
int main()
{
int n,m;
cin >> n >> m;
for(int i=0;i<m;i++){
cin >> c[i];
}
for(int i=0;i<=m;i++){
dp[i][0] = 0;
}
for(int j=0;j<=n;j++){
dp[0][j] = INF;
... | 1 | 53,121,970 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
reverse(t.begin(), t.end());
bool flag = true;
for (int i=0; i<min(s.size(), t.size()); i++) {
if (s.at(i) != t.at(i)) flag = false;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
string s, t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
reverse(t.begin(),t.end());
bool ans=false;
if(s.size()<... | 1 | 83,111,712 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(ll __x = __start; __x < __end; __x++)
typedef pair<int, int> P;
int main() {
int n; cin >> n;
string s; cin >> s;
list<char> C;
for (auto &&c: s) C.push_back(c);
int depth = 0;
int min_ = 1000000;
for ... | 1 | 13,021,212 |
#define LOCAL
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
using namespace std;
typedef long long ll;
static const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,... | 1 | 64,965,508 |
#include <iostream>
#include <vector>
using namespace std;
void print(vector<vector<int>> &A, int n)
{
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (j > 0) cout << " ";
cout << A[i][j];
}
cout << endl;
}
}
int main()
{
int n;
cin >> n;
... | #include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <bitset>
#include <cstdio>
#include <set>
#include <stack>
#include <queue>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for (ll... | 1 | 65,158,230 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(),(x)... | 1 | 59,254,494 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
ll mypow(ll x, ll n){
if(n == 0)
return 1;
if(n % 2 == 0)
return mypow(x * x, n / 2);
else
return x * mypow(x, n - 1);
}
const ll num = mypow(10,9);
const ll n... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | 1 | 63,814,483 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
using namespace std;
void func()
{
string S, T;
cin >> S;
cin >> T;
if (1 > S.length() || S.length() > 10)
{
cout << "No\n";
return;
}
if(S.length() + 1 != T.length())
{
cout << "No\n";
return;... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S;
cin >> T;
bool result = true;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) != T.at(i)) {
result = false;
break;
}
}
if(result) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
... | 1 | 81,780,559 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
int main(){
ll N;
cin >> N;
vector<ll> A(N, 0);
vector<ll> B(N, 0);
for(int i = 0; i < N; i++){
cin >> A[i] >> B[i];
}
ll ans = 0;
... | #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(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
... | 1 | 5,893,632 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, K, ans;
cin >> N >> K;
ans=0;
vector<int> h(N);
for (int i=0; i<N; i++) {
cin >> h.at(i);
}
for (int j=0; j<N; j++) {
if (h.at(j)>=K) {
ans=ans+1;
}
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N, K, ... | 1 | 26,370,540 |
#include <iostream>
#include <climits>
#include <set>
#include <string>
#include <algorithm>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if(0)
int main(){
ll n;
do{
cin >>n;
if (n==0)break;
int mtown=0;
ll g[10][10];
for(... | #include <bits/stdc++.h>
using namespace std;
int a[110][110];
int vis[110];
int n, x, y, z;
int main()
{
while(1)
{
scanf("%d", &n);
if (n == 0) break;
memset(a, 0, sizeof(a));
for(int i=0; i<=9; i++)
for(int j=0; j<=9; j++)
a[i][j] = 100000;
... | 1 | 47,220,645 |
#include <iostream>
using namespace std;
int main(){
int n, x;
int cnt;
while(true){
cnt = 0;
cin >> n >> x;
if(n==0 && x==0) break;
for(int i=1;i<n-1;i++){
for(int j=i+1; j<n;j++){
for(int k=j+1; k<n+1; k++){
if(i+j+k==x){
... | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int n,x,ans=0;
while (1) {
cin >> n >> x;
if (n==0 && x==0) {
break;
}
for (int i=1; i<n+1; i++) {
for (int j=i+1; j<n+1; j++) {
for (int k=j+1; k<n+1; k... | 1 | 72,325,144 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int K;
cin>>K;
vector<long long> H(N);
for(int i=0;i<N;i++){
cin>>H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
long long a=0;
for(int i=K;i<N;i++){
a+=H[i];
}
cout<<a<<endl;
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
long long N, K;
long long H_tmp;
long long sum = 0;
long long sum_tgt = 0;
std::cin >> N >> K;
vector<long long> mons_list(N);
if(K >= N){
goto finish;
}
for(long long i = 0; i < N; i++){... | 1 | 65,403,283 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <utility>
using namespace std;
int main() {
pair<int, int> x;
pair<int, int> y;
cin >> x.first >> x.second >> y.first >> y.second;
int a = max(x.first, y.first);
int b = min(x.second, y.second);
if (b - a < 0)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define SQ(a) (a)*(a)
template <class T, class ... | 1 | 29,167,260 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 998244353
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000000
int main(){
int N;
cin>>N;
vector<int> C(N+1,0);
for(int i=0;i<N;i++){
int a;
cin>>a;
C[a]++;
}
sort(C.begin(),C.end());
C.insert(C.begin(),0);
auto S = C;
... | #include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define ALL(x) x.begin(),x.end()
#define EPS (1e-8)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
typedef long long ll;
bool LTE(double a,double b) { return equals(a,b) || a < b; }
bool LT(double a,double b) { ret... | 1 | 45,312,347 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
string t[10];
t[1] = ".,!? ";
t[2] = "abc";
t[3] = "def";
t[4] = "ghi";
t[5] = "jkl";
t[6] = "mno";
t[7] = "pqrs";
t[8] = "tuv";
t[9] = "wxyz";
int cc=0;
while(cin>>n){
cc++;... | #include <iostream>
using namespace std;
int main(){
string keys[] = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
int n;
string s;
int kind;
int cur;
cin >> n;
for( int lp=0;lp<n;lp++ ){
cin >> s;
cur=-1;
for( unsigned in... | 1 | 30,415,775 |
#include<bits/stdc++.h>
using namespace std;
#define PI 3.1415926536
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,sum;
cin>>N;
sum=N*(N+1)/2-N;
cout<<sum<<endl;
return 0;
} | 1 | 90,061,725 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct edge{
ll to, cost;
};
ll gcd(ll a,ll b){
if(b == 0){
return a;
}else{
r... | #include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
const int inf=1e18;
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("in","r", stdin);
freopen("out","w",stdout);
#endif
int h,n;
cin>>h>>n;
vector<int> dp(h+1, inf);
dp[h]=0;int a,b;
for(int i=0;i<n;i++)
{
cin>>a>>b;
for(int... | 1 | 23,410,075 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
int N;
cin >> N;
N++;
vector<int> time(N);
vector<int> x(N);
vector<int> y(N);
time[0] =... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
int N;
int t[110000];
int x[110000];
int y[110000];
t[0]=0;
x[0]=0;
y[0]=0;
cin >> N;
for (int i = 1; i < N+1; i++)
{
cin >> t[i] >> x[i] >> y[i];
}
bool flag=true;
for (int i = 1; i < N+1; i++)
... | 1 | 11,399,499 |
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin>>n;
map<str, int> m;
bool ans=true;
str bw="";
for(int i=0;i<n;i++)
{
str w;
cin>>w;
if(bw!="")
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | 1 | 23,057,549 |
#ifdef DEBUG
#include "../utils.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define int int64_t
#define INF 10e9
void solve();
void getInput();
int N;
vector<int> L, R;
vector<vector<int>> dp;
void getInput() {
cin>>N;
L = vector<int>(N, 0);
R = vector<int>(N, 0);
dp = ... | #include <iostream>
#include <limits>
#include <utility>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
int r, c;
cin >> r >> c;
v.emplace_back(r, c);
}
vector<vector<int>> dp(n, vector<int>(n, ... | 1 | 61,664,850 |
#include<iostream>
using namespace std;
int main(){
int x,y;
for (int i = 0; i+= 1;){
cin >> x >> y;
if (x == 0 && y == 0){
break;
}
else{
if (x <y){
cout <<x << " " << y << endl;
}
else {
cout <<y <<... | #include <iostream>
int main(int argc, char *argv[]) {
int x, y, t;
while (std::cin >> x >> y) {
if (x == 0 && y == 0) break;
if (x > y) {
t = x;
x = y;
y = t;
}
std::cout << x << " " << y << std::endl;
}
return 0;
} | 1 | 7,360,982 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
string str,aoki;
int q,a,b;
cin>>str>>q;
for(int i=0;i<q;++i){
cin>>aoki>>a>>b;
if(aoki=="print"){
for(int i=a;i<=b;++i){
cout<<str[i];
}
cout<<... | #include <iostream>
#include <string>
using namespace std;
int main(){
string str,order,space ;
char temp;
int q,a,b;
cin>> str ;
cin>> q;
for(int i=0;i<q;i++){
cin >> order;
if (order =="print"){
cin >> a >> b;
for(int j=a;j<=b;j++){
cout << str[j];
}
cout << "\n";
}
else if(order == "rep... | 1 | 19,083,517 |
#include<stdio.h>
int main(void)
{
int a,b;
scanf("%d%d",&a,&b);
if(a<b) printf("a < b\n");
else if(a==b) printf("a == b\n");
else printf("a > b\n");
} | #include <cstdlib>
#include <iostream>
#include <sstream>
std::string eq_string(int a, int b) {
std::string res;
if (a < b) {
res = std::string {"a < b"};
} else if (a > b) {
res = std::string {"a > b"};
} else {
res = std::string {"a == b"};
}
return res;
}
int main() {
... | 1 | 33,152,499 |
#include<bits/stdc++.h>
using namespace std;
int a,b;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>a>>b;
if(a * b % 2 == 0){
cout<<"Even"<<endl;
}else{
cout<<"Odd"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int C = A * B;
if ( C % 2 == 0 ) {
cout << "Even"; }
else {
cout << "Odd"; }
} | 1 | 98,780,353 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 205;
... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define X first
#define Y second
#define pb push_back
#define max_el(x) max_element(x.begin(),x.end())-x.begin()
#define min_el(x) min_element(x.begin(),x.end())-x.begin()
#define mp make_pair
#define endl '\n'
#define fastread ios_base::sync_with_std... | 1 | 15,316,058 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
using P = pair<int,int>;
int main(){
int h, w;
cin >> h >> w;
vector<vector<string>> ve... | 1 | 10,777,364 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,P;
int x = 0;
cin >> A >> P;
x = (A*3 + P)/2;
cout << x <<endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
ll MOD=1000000007;
const double PI = acos(-1);
int main(){
int a,p; cin>>a>>p;
int piece = a*3 + p;
cout << piece/2 << endl;
} | 1 | 53,278,775 |
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
using namespace std;
const ... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 1 | 58,019,912 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 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;
ll tmp;
ll a[2];
cin >> a[0] >> a[1];
a[1]++;
ll x[2];
REP(i,40){
REP(j, 2){
ll sh = a[j]... | 1 | 42,145,154 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >>a>>b;
int s=a+b;
if(s%2==1) cout <<s/2+1<<endl;
else if(s%2==0) cout <<s/2<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int a,b,z;
cin>>a>>b;
z=a+b;
if(z%2==0){
cout<<z/2<<endl;
}
else if(z%2>0){
cout<<z/2+1<<endl;
}
else{
cout<<z/2<<endl;
}
} | 1 | 53,562,025 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main(){
int n; cin >> n;
vector<string> w(n);
rep(i,n)
cin >> w[i];
bool flg = true;
for(int i=0; i<n-1; i++){
if(w[i].back() != w[i+1].front()){
flg = false; break;
}
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define Rep(i,s,n) for(int i=s;i<n;i++)
#define fi first
#define se second
#define all(c) c.begin(),c.end()
typedef long long int ll;
typedef pair<int, int> P;
typedef long double ld;
void Ans(bool x){if(x) cout<<"Yes"<<endl;else ... | 1 | 92,410,435 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n;
str... | #include <bits/stdc++.h>
#include <math.h>
#include <vector>
#include <queue>
#include <iomanip>
#include <string>
#include <algorithm>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep_1 (i,j,n) for(int i=j;i<n;i++)
typedef long long ll;
typedef long l;
const ll ... | 1 | 51,717,892 |
#include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> dp(n+1, INF);
dp[0] = 0;
for (int i = 0, c; i < m; i++) {
cin >> c;
for (int j = c; j <= n; j++) {
if (dp[j - c] != INF && dp[j] > dp[j - c] + 1) {
dp[j] = dp[j - c] + 1;
}
}
}
c... | #include <iostream>
#include <set>
#include <vector>
#include <utility>
using namespace std;
#define FOR(i,n) for(int i=0; i<n; i++)
#define FOR2(i, z, n) for(int i=z; i<n; i++)
int main() {
int change, nbr_coins;
cin >> change >> nbr_coins;
set<int> coins_set;
FOR(i, nbr_coins) {
int coin;
cin >> coin;... | 1 | 69,200,212 |
#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
struct Card{ char suit,value; };
void BubbleSort(struct Card C[],int n){
Card tmp;
for (int i = 0; i < n; i++){
for (int j = n - 1; j >= i; j--){
if (C[j].value < C[j - 1].value){
tmp = C[j]; C[j] = C[j - 1]; C[j - 1] = tmp;
}
... | #include <cstdio>
#include <algorithm>
using namespace std;
typedef pair<char,int> pci;
int N;
pci A[100], B[100], C[100];
void print(pci X[]) {
for (int i=0; i<N; i++) {
if (i > 0) putchar(' ');
printf("%c%d", X[i].first, X[i].second);
}
putchar('\n');
}
bool same(pci X[], pci Y[]) {
for (int i=0; i<N;... | 1 | 70,854,771 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,cnt=0;
string s;
cin >> n >> s;
for(int i=0;i<s.size();i++)if(s[i]!=s[i+1])cnt++;
cout << cnt << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define ll long long
int main() {
int n;... | 1 | 13,844,507 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F(i,s,e) for(ll i=s;i<e;++i)
#define MOD 1000000007
using Graph=vector<vector<ll>>;
int main(){
ll n,m;
cin >> n >> m;
Graph G(n);
ll a,b;
F(i,0,m){
cin >> a >> b;
G[a-1].push_back(b-1);
G[b-1].push_bac... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | 1 | 15,348,989 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int si[8] = {-1,0,1,-1,1,-1,0,1};
int sj[8] = {-1,-1,-1,0,0,1,1,1};
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
int x = 0, y = 0, z = 0;
rep(i,n){
int... | 1 | 63,004,161 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
int... | 1 | 12,738,831 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
for (int i = 1; i <= 1000; i++) {
int aa = (double)i * 0.08;
int bb = (double)i * 0.10;
if (aa==a && bb==b) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
} | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | 1 | 28,071,594 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI d(n);
rep(i,n){
cin >> d.at(i);
}
sort(d.begin(),d.end());
int ans=d.at(n/2... | #include "bits/stdc++.h"
using namespace std;
int main()
{
int n,ans;
ans=0;
cin>>n;
vector<int> d(n);
for(int i=0;i<n;i++)
{
cin>>d.at(i);
}
sort(d.begin(),d.end());
if(d.at(n/2-1)!=d.at(n/2))
{
for(int i=d.at(n/2);i>d.at(n/2-1);i--)
{
ans++;
}
}
cout<<ans<<endl;
} | 1 | 38,468,440 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
int main(){
ll n,k;
cin>>n>>k;
vector<ll> t(n+1);
ll v;
for(int i=0;i<n;i++){
cin>>v;
t.at(v)++;
}
ll co=0;
for(int i=0;i<n+1;i++){
if(t.at(i)==0){
t.at(i)=200001... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
ll N,K;cin>>N>>K;
vector<ll> A(N);rep(i,N)cin>>A[i];
vector<ll> cnt(N,0);
rep(i,N) cnt[A[i]-1]++ ;
sort(cnt.begin(),cnt.end(),greater<ll>());
ll ans=0;
for(int i=K;i<N;++i){
... | 1 | 8,718,344 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'a') {
cout << "vowel" << endl;
}
else if (c == 'e') {
cout << "vowel" << endl;
}
else if (c == 'i') {
cout << "vowel" << endl;
}
else if (c == 'o') {
cout << "vowel" << endl;
}
else if (c == 'u')... | #include <iostream>
#include <vector>
using namespace std;
int main(){
string c;
cin >> c;
string B = "aiueo";
if(B.find(c) != string::npos) {
cout << "vowel" << endl;
} else {
cout << "consonant" << endl;
}
return 0;
} | 1 | 4,024,786 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 10000... | #include<bits/stdc++.h>
using namespace std;
#define read FILE *fp;\
fp=freopen("testcase.txt","r",stdin);
#define ll long long
#define ull unsigned long long
#define sf(n) scanf("%lld",&n)
#define pf(n) printf("%lld ",n)
#define loop for(long long i=0;i<n;i++)
#define lp(b,n) for(long long i=b;i<=n;i++)
#define pb(n) ... | 1 | 58,542,732 |
#include <iostream>
using namespace std;
int main() {
string s, str;
cin >> s >> str;
int a, b;
cin >> a >> b;
string u;
cin >> u;
if(u == s)
--a;
else
--b;
cout << a << ' ' << b;
} | #include <stdio.h>
#include <string.h>
int main(){
char S[15], T[15], U[15];
int a, b;
scanf("%s %s", S, T);
scanf("%d %d", &a, &b);
scanf("%s", U);
(strcmp(U, S) == 0) ? a-- : b--;
printf("%d %d", a, b);
return 0;
} | 1 | 64,540,493 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int m; cin >> m;
ll D = 0; ll S = 0;
for(int i = 0; i < m; i++){
ll d,c; cin >> d >> c;
D += c;
S += d*c;
}
cout << (D-1)+(S-1)/9 << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define disl... | 1 | 27,053,463 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | 1 | 71,045,269 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin >> n;
int w[n];
rep(i,n){cin>>w[i];}
int ABS = 0;
rep(t,n){
int s1=0,s2=0;
for(int i = 0; i < t; i++){
s1 += w[i];
}
for(int j = t; j < n; j++){
s2 += w[j]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int sum=0;
vector<int> w(n);
for(int i=0;i<n;i++){
cin>>w[i];
sum+=w[i];
}
int mini=1e8;
for(int i=0;i<n;i++){
int r=0,l=sum;
for(int j=0;j<i;j++){
r+=w[j];
l-... | 1 | 4,061,823 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | #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 pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 1 | 19,030,782 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <map>
#define ll long long
const ll MOD = 1e9 + 7;
const ll INF = 1 << 29;
int main()
{
std::vector<int> durations(5);
for (auto i=0; i<5; ++i)
std::cin >> duration... | 1 | 13,076,369 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a), q(b), r(c);
rep(i, a) cin >> p[i];
rep(i, b) cin >> q[i];
rep(i, c) cin >... | #include <iostream>
#include <algorithm>
using namespace std;
int X, Y, A, B, C;
int P[1 << 18];
int Q[1 << 18];
int R[1 << 18];
int main() {
cin >> X >> Y >> A >> B >> C;
for (int i = 0; i < A; i++) cin >> P[i];
for (int i = 0; i < B; i++) cin >> Q[i];
for (int i = 0; i < C; i++) cin >> R[i];
sort(P, P + A); reve... | 1 | 25,631,313 |
#include <iostream>
using namespace std;
int f(int x){
return x*x;
}
int main(void){
int dx;
while(cin>>dx){
int sum=0;
for(int i=1;i*dx<600;i++){
sum+=dx*f(i*dx);
}
cout<<sum<<endl;
}
} | #include <iostream>
using namespace std;
int main( void )
{
while ( 1 )
{
int d;
cin >> d;
if ( cin.eof() )
break;
int sum = 0;
for ( int i = d; i < 600; i += d )
{
sum += (i*i*d);
}
cout << sum << endl;
}
return 0;
} | 1 | 3,382,048 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
usi... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int((v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i... | 1 | 76,808,636 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;cin>>n;
int pf[100]{};
int c[1000]{};
for (int i=2;i<=n;i++) {
int t=i;
for (int j=2;j*j<=t&&t>1;j++)
while (t%j==0) {
t/=j;
pf[j]++;
c[pf[j]... | 1 | 39,794,792 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
using namespace std;
int n;
int s;
vector<int> v;
int f;
int b;
int sum = 0;
int ans = 0;
int main() {
while (cin >> n) {
if (n == 0) break;
... | #include<stdio.h>
int main(){
int a,ten[100],i,max=0,min=1000,sum=0,ave=0;
while(1){
max=0;
min=1000;
sum=0;
ave=0;
scanf("%d",&a);
if(a==0)break;
else{
for(i=0;i<a;i++){
scanf("%d",&ten[i]);
}
for(i=0;i<a;i++){
if(max<ten[i]){
max=ten[i];
}
}
for(i=0;... | 1 | 83,214,624 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
void print(string word,vector<string>& output)
{
int a,b;
cin >> a >> b;
output.push_back(word.substr(a,b-a+1));
}
void reverse(string& word)
{
int a,b;
cin >> a >> b;
string temp = word.substr(a,b-a+1);
reverse(... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int
main ()
{
string str;
cin >> str;
int n;
cin >> n;
for (int i = 0; i < n; i++){
string a = "";
int b = 0;
int c = 0;
string d = "";
cin >> a;
cin>>b>> c;
if (a == "replace")
{
cin ... | 1 | 53,596,779 |
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
int main() {
int n, m, x, i;
scanf("%d%d", &n, &m);
for (i = 0; i < m; i++) {
scanf("%d", &x);
n -= x;
}
if (n < 0) n = -1;
printf("%d\n", n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll m;
cin>>m;
ll N;
ll c=0;
cin>>N;
vector<ll>tr(N);
for(ll i=0;i<N;i++){
cin>>tr.at(i);
c+=tr.at(i);
}
ll b=m-c;
if(b<0){
b=-1;
}
cout<<b<<endl;
} | 1 | 19,950,240 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007
#define INF 10000... | #include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define... | 1 | 86,017,875 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < n; i++)
int main() {
int W,N;
cin >> W >> N;
vector<ll> dp(W+1,100000000000);
dp[0] = 0;
int w,v;
rep(i,N) {
cin >> w >> v;
rep(j,W+1) dp[j] = min(dp[j], dp[max(0,j-w)]+v);
}
cout << dp[W] << ... | #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 chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int dp[1005][10005];
i... | 1 | 97,091,722 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define tc(t) int t; cin>>t; while(t--)
#define f(n) for(int i=0;i<n;i++)
#define endl "\n"
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
vector<int> v(n);
int sum=0;
f(n)cin>>v[i];
for(int i=0;i... | #include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define rapgame ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define eb emplace_back
#define vi vector <int>
#define vlli vector <lli>
#define vulli vector <ulli>
#define vchar v... | 1 | 55,204,076 |
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main(){
ll X,Y,Z,K,i,j,k;scanf("%lld%lld%lld%lld",&X,&Y,&Z,&K);
ll A[X],B[Y],C[Z];
for(i=0;i<X;i++) scanf("%lld",&A[i]);
for(j=0;j<Y;j++) scanf("%lld"... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PL = pair<ll,ll>;
int main()
{
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z), ab, abc;
for(int i = 0; i < x; i++)cin >> a[i];
for(int i = 0; i < y; i++)cin >> b[i];
for(int i = 0; i < z; i++)ci... | 1 | 100,405,393 |
#include <bits/stdc++.h>
#define f(i, a, b) for (int i = a; i < (b); ++i)
#define f1(i, a, b) for (int i = a; i <= (b); ++i)
#define rep(i, n) f(i, 0, n)
using namespace std;
using ll = long long;
int main(void) {
int n;
cin >> n;
vector<int> p(n), q(n);
rep(i, n) cin >> p[i];
rep(i, n) cin >> q[i];
vector<... | #include <bits/stdc++.h>
using namespace std;
int facctorialMethod(int k){
int sum = 1;
for (int i = 1; i <= k; ++i)
{
sum *= i;
}
return sum;
}
void solve(){
int n,m,x,count=0,r[2];
scanf("%d",&n);
int a[2][n];
for (int i = 0; i < n; i++)
{
scanf("%d",&a[0][i]);
}
for (int... | 1 | 71,002,450 |
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <numeri... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
#include<random>
#include<ctime>
#include<set>
using namespace std;
const long long int mod=1000000007;
const lo... | 1 | 74,881,553 |
#include <iostream>
#include <vector>
#include <algorithm>
#define INF 1010101010
using namespace std;
int main()
{
long long n;
cin >> n;
long long ans = 0;
for (long long i = 1; i * i < n; i++) {
long long t = (n - i) / i;
if ((n - i) % i == 0 && n / t == n % t) {
ans += (n - i) / i;
}
}
cout << ans <<... | #include <bits/stdc++.h>
using Int = long long;
using namespace std;
int main() {
Int n;
cin >> n;
Int ans = 0LL;
for (Int i = 1; i * i < n; i++) {
if (n % i == 0) {
auto j = n / i;
if (j - i >= 2) {
ans += j - 1;
}
}
}
cout << ... | 1 | 24,699,429 |
#include<iostream>
#include<math.h>
using namespace std;
#define ll long long
int main(){
int n,k,x,y;
cin>>n>>k>>x>>y;
int total=0;
if(n<=k)
{
total=x*(n);
}else{
total=k*x;
total+=y*(n-k);
}
cout<<total;
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N,K,X,Y,ans;
cin>>N>>K>>X>>Y;
ans=min(N,K)*X+max(N-K,0)*Y;
cout<<ans<<endl;
return 0;
} | 1 | 97,753,752 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long H;
int N;
int ans = 0;
int t = 0;
cin >> N >> H;
for(int i=0;i<N-1;++i){
long h; cin >> h;
if(h <= H){
t++;
}else{
if(t > ans){
ans = t;
}
t = 0;
}
H = h;
}
if(t > ans){
ans = t;
}
... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n;
cin >> n;
ll h[n];
for(int i=0;i<n;i++)cin >> h[i];
ll m=0;
for(int i=0;i<n;i++){
if(h[i]<h[i+1])continue;
ll k=0;
while(i+k+1<=n-1 && h[i+k]>=h[i+k+1]){
k++;... | 1 | 90,898,060 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
vector<int> c;
for (int i = 1; i <= min(A, B); ++i) {
if (A % i == 0 && B % i == 0) c.push_back(i);
}
reverse(c.begin(), c.end());
cout << c[K-1] << endl;
} | 1 | 42,783,914 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
int cnt = 0;
REP(i, n) if (s[i] == 'o') cnt++;
if (15 - n + cnt >= 8) cout << "YES" << '\n';
else cout << "... | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
string s;
cin>>s;
int x=0,n=s.size();
for(int i=0;i<n;i++)s[i]-'o'?x++:0;
cout<<(15-x>7?"YES":"NO")<<endl;
} | 1 | 32,462,922 |
#include <stdio.h>
int
main(void)
{
int n;
scanf("%d", &n);
float x1, y1, x2, y2, x3, y3, x4, y4;
while (n--) {
scanf("%f %f %f %f %f %f %f %f",
&x1, &y1, &x2, &y2, &x3, &y3, &x4, &y4);
if ((y2 - y1)/(x2 - x1) == (y4 - y3)/(x4 - x3)) {
printf("YES\n");
} else {
printf("NO\n");
}
}
return 0;
} | #include <iostream>
#include <cmath>
#define rep(i,a,n) for(int i=a; i<n; i++)
using namespace std;
int main() {
int n; cin >> n;
for(int i=0; i<n; i++) {
double x1, y1, x2, y2, x3, y3, x4, y4;
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
double a1 = x2 - x1;
double b1 = ... | 1 | 6,216,374 |
#include <iostream>
#include <stdio.h>
using namespace std;
int HelloWorld(){
cout << "Hello World" << endl;
return 0;
}
int XCubic(){
int x;
cin >> x;
if (1 <= x && x <= 100){
x = x*x*x;
cout << x << endl;
return 0;
}
return 1;
}
int Rectangle(){
int a, b, area, perimeter;
cin >> a >>b;
if (1 <= a && b... | #include<stdio.h>
int main(void)
{
int a, b;
scanf("%d",&a);
scanf("%d",&b);
if(a<b){
printf("a < b\n",a, b);
}
if(a>b){
printf("a > b\n",a, b);
}
if(a==b){
printf("a == b\n",a, b);
}
return 0;
} | 1 | 43,989,339 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k, s, r=0;
cin >> k>>s;
for (int y=0; y<=k; y++){
for (int z=0;z<=k;z++){
int op=s-y-z;
if (op >= 0 && op <= k) r++;
}
}
cout << r;
return 0;
} | #include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
ll cn... | 1 | 40,350,722 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;cin>>s;
long long n;cin>>n;
for(int i=0;i<n;++i){
if(s[i]=='1' && n<=i+1){
cout<<1<<endl;
return 0;
}
else if(s[i]!='1'){
cout<<s[i]<<endl;
return 0;
}
}
r... | #include<bits/stdc++.h>
using namespace std;
int main() {
string S;
long long K;
cin >> S >> K;
for (long long i=0; i<K; i++) {
if (S.at(i)!='1') {
cout << S.at(i);
return 0;
}
}
cout << "1\n";
} | 1 | 14,760,170 |
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,k;
cin >> n >> k;
ll sup = (n-1)*(n-2)/2;
if(k > sup){
cout << -1 << endl;
return 0;
}
vector<pair<ll,ll>> ans... | 1 | 24,316,679 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n;
cin>>n;
vector<ll> a(n);
rep(i,n) cin>>a[i];
vector<ll> s(n+1,0);
rep(i,n) s[i+1]... | #include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll n;
cin>>n;
ll a[n];
ll ans=0;
rep(i,n){
cin>>a[i];
}
ll sum[n+1];
sum[0]=0;
map<ll,ll> b;
b[0]=1;
rep(i,n){
sum[i+1]=sum[i]+a[i];
}
rep(i,n){
if(b.find(sum[i+1])==b.e... | 1 | 89,139,231 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end()
#define pb push_back
#define mp make_pair
#define... | #include<bits/stdc++.h>
#define PI 3.141592653589
using namespace std;
using ll = long long;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
vector<int> a(3);
for(int i=0; i<3; ++i) cin >> a[i];
sort(a.rbegin(), a.rend());
int mx = a[0], mid = a[1];
int dif = mx - mid;
i... | 1 | 34,985,666 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<pair<int, int>> a(100001), b(100001);
for (int i = 0; i < 100001; i++)
{
a[i] = make_pair(0, i + 1);
b[i] = make_pair(0, i + 1);
}
for (int i = 0; i < n; i++)
{
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
const int N = 100010;
signed main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> odd(N), even(N);
int odd_max = 0, oddv = 0;
int even_max = 0, evenv = 0;
rep(i,n) {
cin >> a[i];
if(i % 2 == 0) {
... | 1 | 90,777,562 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
int r; cin>>r;
cout<<r * r<<endl;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t = 1;
while(t--){
solve();
}
return 0;
} | 1 | 78,600,425 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);cout.precision(10);}} fast;
#define FOR(I,X,Y) for(long long (I)=(X);(I)<(Y);(I)++)
#define REP(I,X,Y) for(long long (I)=(Y)-1;(I)>=(X);(I)--)
#define ALL(X) (X).begin(),(X).end()
#define pb push_back
#define C... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#includ... | 1 | 12,480,746 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.length();
vector <int> cnt(26, 0);
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
long long ans = 1 + (long long) n * (n - 1) / 2;
for (int x : cnt) {
ans -= (long long) x * (x - 1) / 2;
}
cout << an... | #include<bits/stdc++.h>
typedef long long ll;
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
char S[200010];
int main(){
#ifdef XZZSB
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
scanf("%s",S... | 1 | 7,265,172 |
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
const ll MOD = 1000000007;
using pint = pair<ll, ll>;
int main(){
ll N;
cin >> N;
vector<ll> sum(110000, 0);
for (int i = 0; i < N; i++){
ll tmp = 0;
cin >> tm... | 1 | 8,887,605 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
while(true){
cin>>n>>m;
if(n==0&&m==0)break;
vector<pair<int,int>> e;
for (int i = 0; i < n; ++i) {
int a,b;
cin>>a>>b;
e.emplace_back(b,a);
}
sort(e.rbegin(),e.... | #include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
int main() {
pair<int, int> road[20000];
int i, n, money, a, b, j = 0, kitai = 0;
cin >> n;
cin >> money;
while (n != 0 || money != 0) {
for (i = 0; i < n; i++) {
cin >> a >> b;
road[i] = make_pair(b, a);
kitai += a*b;
... | 1 | 9,768,269 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
set<ll> S;
for(ll i=0;i<N;i++) {
ll A;
cin>>A;
if(S.count(A)) {
cout<<"NO"<<endl;
return 0;
}
S.insert(A);
}
cout<<"YES"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define trace(x) cerr<<x<<END;
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int i = (b); i > (a); --i)
const int mod... | 1 | 51,423,032 |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string S,T="keyence"; cin >> S;
int N=S.size();
for (int i=0;i+6<N;++i){
if (S.substr(i,7)==T){
cout << "YES" << '\n';
return 0;
}
}
for (int i=1;i<7;++i... | #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... | 1 | 21,072,228 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LM... | 1 | 86,721,146 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359;
#define inf (1 << 21);
#define mod 1000000007;
int main() {
int N, K; cin >> N >> K;
int R, S, P; cin >> R >> S >> P;
string T; cin >> T;
vector<vector<char>> t(K);
for (int i = 0; i... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, i... | 1 | 1,207,153 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <vector>
#include <functional>
#include <queue>
#include <unordered_set>
#include <climits>
#include <set>
#include <list>
#include <cmath>
using namespace std;
typedef long l... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | 1 | 12,822,815 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
int main() {
int n ;
std::vector< long long > a ;
std::cin >> n ;
for( int i = 0 ; i < n ; i++ ) {
long long ii ;
std::cin >> ii ;
a.push_back( ii ) ;
}
std::cout << *std::min_element( a.begin()... | #include <iostream>
#define REP(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int n;
long M, m, s;
int main(void) {
cin >> n;
M = -1000000;
m = 1000000;
s = 0;
REP(i, 0, n) {
long a;
cin >> a;
M = max(M, a);
m = min(m, a);
s += a;
}
cout << m << " " << M << " " << s << endl... | 1 | 1,254,916 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<time.h>
#include<vector>
using namespace std;
int main()
{
int d,t,s;
scanf("%d%d%d",&d,&t,&s);
if(t*s>=d){
printf("Yes\n");... | 1 | 78,328,239 |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
string ans = "-1 -1 -1";
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= N; ++j) {
int k = N - j - i;
if (k < 0) continue;
if (i * 10000 + j * 5000 + k * 1000 == Y) {
ans = to_string(i... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i > ll(b);... | 1 | 64,040,341 |
#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);
string s;
cin >> s;
set<char> d;
for (char c = 'a'; c <= 'z'; c++) d.in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >>s;
set<char> chk;
int n=s.size();
rep(i,n){
chk.insert(s.at(i));
}
if(chk.size... | 1 | 45,241,379 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
string s1,s2;
cin>>s1;
cin>>s2;
if (s1[0]==s2[2] && s1[1]==s2[1] && s1... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
string s, t;... | 1 | 90,267,092 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
ll h,w;
cin>>h>>w;
if(h!=1&&w!=1)
{
cout<<(h*w+1)/2<<endl;
return 0;
}
cout<<1;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | 1 | 4,841,579 |
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
void solve(){
int k,n;
cin >> k >> n;
if(k*500 >= n) cout <<"Yes";
else cout <<"No";
}
int main(){
fastio;
#ifndef ONLINE_JUDGE
... | #include <iostream>
int main()
{
int K, X;
std::cin >> K >> X;
if (500*K >= X) std::cout << "Yes" << std::endl;
else std::cout << "No" << std::endl;
return 0;
} | 1 | 94,683,768 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
int l[h][w];
rep(i,h) {
rep(j,w) {
if(s[i][j]=='#') l[i][j] = 0;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int h,w;cin>>h>>w;
int a[2003][2003];
rep(i,h){
string s;cin>>s;
rep(j,w){
if(s[j]=='#')a[i][j]=0;
else a[i][j]=1;
}
}
int a... | 1 | 14,029,734 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
cout << ( n - 1 ) / 2 << endl;
return... | #include<iostream>
using namespace std;
int main() {
int N,ans;
cin >> N;
if (N%2==0) {
ans = N/2-1;
}
else {
ans = (N-1)/2;
}
cout << ans;
} | 1 | 56,754,539 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define FAST {ios_base::sync_with_stdio(false);cin.tie(NULL);}
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
#define rep(n) for(int i=0;i<(n);i++)
#define rrep(n) for(int i=(n)-1;i>=0;i--)
#define mem(a,b... | #include <bits/stdc++.h>
using namespace std;
char grid[5001][5001];
long long mod=1e9+7;
int soln(int n,int m){
int dp[n][m];memset(dp,0,sizeof(dp));
dp[n-1][m-1]=1;
for(int i=n-1;i>=0;i--){
for(int j=m-1;j>=0;j--){
if(i==n-1&&j==m-1)continue;
else if(grid[i][j]=='#')dp[i][j... | 1 | 54,497,609 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main() {
int a,b,c;
cin >> a>> b>> c;
if(a-b<=c){cout << c-(a-b) << endl;}else{cout << 0 << endl;}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
int a,b,c;cin>>a>>b>>c;
cout<<max(0,c-(-b+a))<<endl;
} | 1 | 12,523,837 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
string S;
cin>>S;
int A[26];
rep(i,26)A[i]=0;
rep(i,S.size())A[S[i]-'a']+=1;
for(int j:A){
if(j>=2){
cout<<"no"<<endl;
return 0;
}
}
cout<<"y... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#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++)
int main() {
string S;
cin >> S;
int N = S.size();
int co = 0;
int ans = 0;
rep(i, N) {
rep(j, N) {
... | 1 | 53,574,992 |
#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... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define EPS 1e-10
using namespace std;
typedef long long llong;
int main() {
int n;
while (cin >> n, n) {
vector<int>v(n);
for (int i = 0; i < n; i++)cin >> v[i];
sort(v.begin(), v.end());
int a = 100000000;
for (int i = 1; i < n; i++) {
a = min(a, abs(v... | 1 | 64,900,506 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int n;
cin >> n;
long long ans;
int a[n];
ans = 0;
rep(i, n)
{
cin >> a[i];
if (a[i] == 0) continue;
if (i != 0)
a[i] += a[i - 1];
ans += a[i] / 2;
a[i] %= 2;
}
cout << ans << endl;
r... | 1 | 53,788,422 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.