code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <functional>
#define ll long long int
using namespace std;
int h[6], w[6];
int main() {
int H, W, K, num, ans = 0;
cin >> H >> W >> K;
vector<string> c(H);
for (int i = 0; i < H; i++){
cin >> c[i];
}
for (int ... | #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 | 74,590,690 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <bitset>
#include <math.h>
typedef long long ll;
typedef unsigned long long ull;
#define vi std::vector<int>
#define vl std::vector<ll>
#define floop(n) for(int i = 0; i < n; ++i)... | #include<bits/stdc++.h>
using namespace std;
int main() {
int num, step, dist;
scanf("%d", &num);
int t, x, y, pt=0, px=0, py=0;
for(int i = 0; i < num; i++) {
scanf("%d %d %d", &t, &x, &y);
step = t - pt;
dist = abs(x - px) + abs(y - py);
if (dist > step) {
cout << "No" <... | 0 | 58,165,134 |
#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 INF = pow(10,9)+7;
int main(){
string s,t;
cin >> s >> t;
int u = s.size() - 1;
int n=t.size()-1;
int next = u-1;
while(u>=0){
if(s[u]==t[n] || s[u]=='?') n--;
else{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int INF = 1e9;
int main() {
string s;
cin >> s;
int n = s.size();
vector<vector<int> > dp(n + 1, vector<int>(2));
dp[0][0] = 1;
for(int i = 0; i < n; i++) {
{
if (s[i] == '0') {
dp[i+1][0] =... | 0 | 13,531,972 |
#include<bits/stdc++.h>
using namespace std;
int main(){
double n;
cin >> n;
n/=3;
cout << setprecision(12) <<pow(n,3) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i,n) for(i=0;i<n;i++)
#define forn(i, n) for (ll i = 0; i < (ll... | 0 | 47,507,100 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
int main() {
string s,t;
cin>>s>>t;
sort(s.begin(),s.end());
sort(t.begin(),t.end(),greater<int>());
if(s<t)cout<<"Yes";
else cout<<"No";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 18,826,075 |
#include <bits/stdc++.h>
using namespace std;
int toNum(string s){
int time = 0;
time += (s[0] - '0') * 10 * 3600;
time += (s[1] - '0') * 3600;
time += (s[3] - '0') * 10 * 60;
time += (s[4] - '0') * 60;
time += (s[6] - '0') * 10;
time += (s[7] - '0');
return time;
}
int main(){
int n... | #include<iostream>
#include<queue>
#include<string>
#include<map>
#define F first
#define S second
using namespace std;
char c[33][33];
int w,h;
int solve(int x, int y){
typedef pair < int, int > P;
queue < P > que;
int count = 1;
que.push( P(x, y) );
c[y][x] = '#';
while(!que.empty()){
P q = que.front(... | 0 | 54,213,584 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<vector<int>> vvi;
type... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include ... | 0 | 95,055,861 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define _rrep(i,n) rrepi(i,n,0)
#define rrepi(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS... | #include <iostream>
int main() {
int A, B, K;
std::cin >> K;
std::cin >> A >> B;
for(int i = A; i <= B; i++) {
if(i % K == 0) {
std::cout << "OK" << std::endl;
return 0;
}
}
std::cout << "NG" << std::endl;
return 0;
} | 0 | 35,864,259 |
#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);... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#define rep(i, x, n) for(int i = x; i < n; i++)
using namespace std;
const long long INF = 1LL << 60;
long long GCD(long long a, long long b... | 0 | 14,956,582 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
char s[101]={};
char t[101]={};
cin>>s>>t;
int a=strlen(s);
int b=strlen(t);
for(int i=0; i<b; i++){
cout<<t[i];
}
for(int i=0; i<a; i++){
cout<<s[i];
}
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, nmin, nmax;
while (cin >> n >> nmin >> nmax, n) {
vector<int> P(n);
for (int i = 0; i < n; ++i) cin >> P[i];
int diff = 0;
int res = -1;
for (int i = nmin - 1; i <= nmax - 1; ++i) {
if (diff <= ... | 0 | 80,884,151 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
int main(){
string S;
cin >> S;
int c0 = count(all(S),'0');
int c1 = count(all(S),'1');
int cm=min(c0,c1);
cout << 2*cm << endl;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T>
class UF
{
public:
UF() {
count = 0;
}
void push( T a ) {
M[a] = count;
V.push_back( count );
rank.push_back( 0 );
count++;
}
void unite( T a, T b ) {
long long int x = find( M[a] );
long long int y = find( M[b] );
if( x == y )retur... | 0 | 67,906,579 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include<bits/stdc++.h>
using namespace std;
long long dp[100005][5];
int main()
{
int n,x,y,z,p,q,i;
cin>>n;
cin>>dp[1][1]>>dp[1][2]>>dp[1][3];
for(i=2; i<=n; i++)
{
cin>>x>>y>>z;
dp[i][1]=x+max(dp[i-1][2],dp[i-1][3]);
dp[i][2]=y+max(dp[i-1][1],dp[i-1][3]);
... | 0 | 45,599,385 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main()
{
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll ans1 = a*c;
ll ans2 = a*d;
ll ans3 = b*c;
ll ans4 = b*d;
cout << max(ans1, max(ans2, max(ans3, ans4))) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typed... | 0 | 78,795,366 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
ll n,k;
cin >> n >> k;
ll cnt = 0,cnts = 0;
ll ans = 0;
if(k % 2 == 1){
cnt += n/k;
ans += cnt*c... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int m = 0, f = 0, r = 0, count = 0;
string grade[100];
while (1){
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) break;
if (m == -1 || f == -1) grade[count++] = "F";
else if (m + f >= 80) ... | 0 | 63,851,141 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x;
cin >> x;
rep(i, 5) {
int o100 = x / 100, u100 = x % 100;
int num = min(o100, u100 / (5 - i));
x -= (105 - i) * num;
}
if (x % 100 == 0)
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N,C,K;
cin >> N >> C >> K;
vector<long long> T(N);
for(int i=0;i<N;i++){
cin >> T.at(i);
}
sort(T.begin(),T.end());
long long bus = 0;
long long tmp = 0;
long long time = T.at(0);
for(int i=0;i<N;i++){
if(tmp==0){
time... | 0 | 63,397,560 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> p(n), q(n);
for(int i = 0; i < n; ++i)
cin >> p[i];
for(int i = 0; i < n; ++i)
cin >> q[i];
vector<int> sorted = p;
sort(sorted.begin(), sorted.end());
ll p_cnt, ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int la,hh,n,A,B,i,j,a[500001];
int main(){
scanf("%d%d%d",&n,&A,&B);
if(B+A>n+1)return puts("-1"),0;
if((ll)B*A<(ll)n)return puts("-1"),0;
for(i=B;i;i--)printf("%d ",i);
la=B;
for(i=2;i<A;i++){
hh=min(B,n-la-(A-i));
for(j=hh+la;j>la;j--)printf(... | 0 | 66,361,538 |
#include <iostream>
#include <vector>
int main()
{
int n, t;
std::cin >> n >> t;
std::vector<int> arr(n);
for (int i = 0; i < n; ++i)
{
int tmp;
std::cin >> tmp;
arr[i] = tmp;
}
int64_t sum = 0;
for (int i = 0; i < n; ++i)
{
if (i != n - 1)
{
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leadinz 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 | 38,417,301 |
#include <stdio.h>
#include <string.h>
const char* echo(int N, char* S) {
if(N % 2 == 1) {
return "No";
}
for(int i=0; i < N/2 ;i++){
if(S[i] != S[i + N/2]){
return "No";
}
}
return "Yes";
}
int main() {
int N;
char S[102];
scanf("%d %s", &N, S);
printf("%s\n", ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#defi... | 0 | 79,396,676 |
#include <bits/stdc++.h>
using namespace std;
map<pair<int, int>, int> mp;
long long an[10];
int h, w, n;
bool ok(int a, int b){
return a > 0 && b > 0 && a + 2 <= h && b + 2 <= w;
}
int main(){
scanf("%d%d%d",&h,&w,&n);
for(int i = 1; i <= n; ++i){
int x, y;
scanf("%d%d",&x,&y);
for(int j = x - 2; j <= x; ++j)... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n), b(n-1);
for (size_t i = 0; i < n-1; i++) cin >> b[i];
a[n-1] = b[n-2];
for (int i = n-2; i > 0; i--) {
if (b[i-1] <= b[i]) a[i] = b[i-1];
else a[i] = b[i];
... | 0 | 79,633,988 |
#include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long LL;
typedef pair<int, int> PII;
void f(int n) {
vector<int> prime{3, 5, 7, 11, 13, 17, 19, 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) cin >> S.at(i);
int ans = 0;
for (int k = 0; k < N; k++) {
bool ok = true;
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
int x1 = k+j;
if (x1... | 0 | 55,791,589 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
vector<pair<int,int> >arr(n);
for(int i=0; i<n; i++)
{
int num;
cin>>num;
arr[i]=make_pair(num,i+1);
}
sort(arr.begin(),arr.end());
for(int i=0... | #include <cstdio>
#include <cstdio>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 200007;
const int M = 15005;
const int offset = 7500;
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
con... | 0 | 91,984,659 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010, M = 1010, mod = 1e9 + 7;
int x, y;
int qp(int a, int b)
{
int res = 1;
while (b)
{
if (b & 1) res = (LL)res * a % mod;
a = (LL)a * a % mod;
b >>= 1;
}
return ... | 0 | 42,489,960 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<
pair<int, int>,
null_type,
less_equal<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update>
order... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int... | 0 | 39,047,038 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<(n);i++)
#define init(a,i) for(int k=0;k<(i);k++)(a)[k]=0
#define in(a,i) for(int k=0;k<(i);k++)cin>>(a)[k]
#define all(a) (a).begin(),(a).end()
#define el(a) (a).end()-(a).begin()
#define mod... | #include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int a[N];
bool visited[N];
for (int i=0; i<N; i++) {
cin >> a[i];
}
for (int i=0; i<N; i++) {
visited[i] = false;
}
visited[0] = true;
int next = a[0];... | 0 | 64,958,513 |
#include <iostream>
using namespace std;
int a[20][20];
int root(int x, int y){
if (x == 0) {
if(a[0][y - 1] == -1)return a[0][y-1] = root(0, y - 1);
else return a[0][y - 1];
}
if (y == 0) {
if (a[x - 1][0] == -1)return a[x-1][0] = root(x - 1, 0);
else return a[x - 1][0];
}
if (a[x - 1][y] == -1) a[x - 1]... | #include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | 0 | 32,245,129 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n) - 1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
const long long MOD = 1e9 + 7, INF = 1e18;... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
long long INF = 1LL << 60;
int main() {
long long N;
cin >> N;
int root_N = sqrt(N);
long long ans = INF;
for (long long i = 1; i <= root_N; i++) {
long long j = N ... | 0 | 3,348,366 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
struct Point {
double x, y;
};
void printPoint(Point p) { printf("%.8f %.8f\n", p.x, p.y); }
void koch(int d, Point p1, Point p2) {
if (d == 0) return;
Point diff = {p2.x - p1.x, p2.y - p1.y};
Point... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int a,b;
bool B = true;
bool B2 = true;
int cnt = 0;
vector<int> x(n); vector<int> y(n);
for(int i=0;i<n;i++)cin >> x[i];
for(int i=0;i<n;i++)cin >> y[i];
vector<int> v(n);
for(int i=0;i<n;i++)v[i] = i+1;
... | 0 | 63,346,251 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include "bits/stdc++.h"
#define all(x) x.begin(), x.end()
#define rep(i,n) for (i64 i = 0; i < (n); ++i)
#define reps(i,s,t) for (i64 i = (s); i <= (t); ++i)
#define repr(i,s,t) for (i64 i = (s); i >= (t); --i)
#define LF '\n'
#ifdef DBG
#define trace(...) _trace(#__VA_ARGS__, __VA_ARGS__);
#else
#def... | 0 | 26,419,768 |
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define V vector
template <typename T> bool chmin(T &a, const T &b) {if(a > b){a = b... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#inclu... | 0 | 51,197,615 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h,n;
cin >> h >> n;
vector<int>a(n);
for(int i = 0;i<n;i++) cin >> a.at(i);
int sum = 0;
for(int i = 0;i < a.size();i++) sum += a.at(i);
if(sum >= h) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int n;
cin >> n;
std::map<int, int> even;
std::map<int, int> odd;
rep(i, n)
{
int v;... | 0 | 60,480,058 |
#include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)... | #include<stdio.h>
int main(){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a<b){
if(b<c){
printf("Yes\n");
}else{
printf("No\n");
}
}else{
printf("No\n");
}
} | 0 | 57,318,039 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
char S[11];
scanf("%s",S);
int len;
for(len = 0; S[len] != '\0'; len++);
if(S[0] != '... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sf scanf
#define pf printf
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 998244353LL
#define maxn 300005
#define IN freopen("C.in","r",stdin)
#define OUT freopen("output.txt",... | 0 | 79,360,817 |
#include<bits/stdc++.h>
using namespace std;
long long int a[105];
#define mod 1000000007
int main(){
int n, k;
cin>>n>>k;
for(int i=0; i<n; i++)
cin>>a[i+1];
vector<int>prefix(k+1, 1);
int dp[n+1][k+1];
for(int i=0; i<=n; i++)
for(int j=0; j<=k; j++)
... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 90,330,351 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include <bits/stdc++.h>
#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ())
#define FOR(k, n) for(int k=0; k<n; k++)
#define pb push_back
using namespace std;
... | 0 | 18,479,158 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
class dep_union_find{
int n_;
vector<int> par, rank, dep;
public:
dep_union_find(int n): n_{n},... | #include "bits/stdc++.h"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll > pi;
typedef pair<pair<ll, ll >, ll > pii;
vector<ll > vec;
vector<vector<ll > > vec2;
ll MOD = 1000000007;
ll INF = 9223372036854775807;
int main(){
ll N;
cin >> N;
ll ans = 0;
ll AB = 0;
ll A = 0;
... | 0 | 84,170,512 |
#include <iostream>
using namespace std;
int main(void){
int a;
cin>>a;
int b=a*800;
int p=(a/15)*200;
if(a<15){
cout<<b<<endl;
}
else{
cout<<b-p<<endl;
}
} | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | 0 | 91,346,581 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
int a, b;
cin >> a >> b;
if(a < b){
for(int i = 0; i < b; i++){
cout << a;
}
cout << endl;
}
else{
for(in... | #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 | 22,374,883 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string a;
while(cin>>a){
if(a=="#") break;
int len=a.size();
int k=0,m=2;
for(int i=0;i<len;i++){
if(a[i]=='q'||a[i]=='w'||a[i]=='e'||a[i]=='r'||a[i]=='t'||a[i]=='a'||a[i]=='s'||a[i]=='d'||a[i]=='f'||a[i]=='g'||a[i]=='z'||a[i]=='x'||a[i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i=0;i<(n); i++)
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 namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
int main(... | 0 | 32,758,623 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<pair<long long,long long>> a(n);
for(int i=0;i<n;i++)
{
int a1,a2;
cin >> a1 >> a2;
a.at(i) = make_pair(a1,a2);
}
sort(a.begin(),a.end());
long long k=0,h=0;
for(int i=0;i<n;i++)
{
long long f=a.at(i).first,
... | #include<cstdio>
using namespace std;
int n, m, pre[100005], dist[100005];
inline int find(int x){
if(pre[x]^x) {
int nf = pre[x]; pre[x] = find(pre[x]); dist[x] += dist[nf];
}
return pre[x];
}
int main(){
bool flag=true;
scanf("%d%d", &n, &m);
for(register int i=1; i<=n; ++i)pre[i]=i;
for(re... | 0 | 27,399,158 |
#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 <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 60,606,834 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void bubble(struct Card a[], int n) {
Card hoge;
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (a[j].value < a[j - 1].value) {
hoge = a[j];
a[j] = a[j - 1];
a[j - 1] = hoge;
}
}
}
}
void selection(... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
string S; cin >> S;
map<char, set<int>> M;
rep(i,S.size()) {
M[S[i]].insert(i);
}
for (auto x : M) {
char c = x.first;
auto j = begin(M[c]);
... | 0 | 57,727,166 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
unordered_set<char> US;
for(int i = 0; i <= S.size(); ++i){
if(US.find(S[i]) != US.end()){
cout << "no" << endl;
return 0;
}
else US.insert(S[i]);
}
cout << "yes" << endl;... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
type... | 0 | 18,488,911 |
#include <cstdio>
#include <string>
#include <queue>
using namespace std;
int main() {
priority_queue<int> PQ;
char com[10];
int key;
while(1) {
scanf("%s", com);
if(com[0] == 'e' && com[1] == 'n') break;
else if(com[0] == 'i') {
scanf("%d", &key);
PQ.push... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int (i)=0;(i)<(n);++(i))
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);++(i))
#define EACH(e,v) for(auto& e:v)
#define ALL(v) (v).begin(),(v).end()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort((v).rbegin(),(v).rend())
#define PE... | 0 | 93,636,839 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(auto i=a;i<b;i++)
#define repD(i,a,b) for(auto i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define tr(c,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int solve(int n, int k, vector<vector<int>> a) {
vector<bool> res(n, true);
for(auto aa: a) {
for(auto aaa: aa) {
res[aaa -1] = false;
}
}
int count = 0;
for(auto r: res) {
if(r)
count++;
}
return count;
}
int main(... | 0 | 3,041,802 |
#include <bits/stdc++.h>
using namespace std;
long long int w[51];
long long int b[51];
long long int p[51];
void burg(int n){
w[0]=1; b[0]=0; p[0]=1;
for(int i=0;i<n;i++){
b[i+1]=2+2*b[i];
p[i+1]=1+2*p[i];
w[i+1]=b[i+1]+p[i+1];
}
}
long long int answer(long long int y,int level){
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#define rep0(i, n) for (i = 0; i < n; i++)
#define rep(s, i, n) for (i = s; i < n; i++)
using namespace std;
int H,W,K;
char c[6][6];
int main()
{
int i, j,ans=0;
cin >> H >> W >> K;
rep0(i, H) rep0(j,W) cin >>c[... | 0 | 46,065,223 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #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 vll vector<long long>
#define pll pair<long long, long long>
#define mll map<long long, long long>
#define sz(v)... | 0 | 76,122,779 |
#include<iostream>
#include<cctype>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cctype>
#include<cstring>
#include<utility>
const int inf=0x7fffffff;
typedef long long int ll;
using namespace std;
int cnt[30];
int main()
{
... | #include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
template <typename T>
using V = vec... | 0 | 87,160,531 |
#include<iostream>
#include<cstdio>
#include<cstring>
#define maxn 10010
using namespace std;
int n,q;
int father[maxn];
int rank[maxn];
void init()
{
for(int i=0; i<n; ++i)
{
father[i]=i;
rank[i]=0;
}
}
int find(int x)
{
if(father[x]==x)
return x;
else
return father[... | #include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(v) int(v.size())
using namespace std;
const int MAXN = (int) 2e5 + 10;
const int INF = (int) 2e9 + 7;
const ll LINF = (1LL<<62)... | 0 | 88,721,782 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int H,W;
cin >> H >> W;
vector<string> vec(H);
rep(i,H){
cin >> vec[i];
}
... | 0 | 90,642,939 |
#include<iostream>
using namespace std;
int A[1010];
int partation (int l, int r) {
int temp;
int i = l-1;
int x = A[r];
for (int j = l; j < r; j++) {
if (A[j] >= x) {
i++;
temp = A[i];
A[i] = A[j];
A[j] = temp;
}
}
temp = A[i+1];
... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i,... | 0 | 39,277,320 |
#include <iostream>
#include <cstdlib>
using namespace std;
int main(){
int w, h, x, y, r;
cin >>w >>h >>x >>y >>r;
int lx,lx2,ly,ly2;
lx = x+r;
lx2 = x-r;
ly = y+r;
ly2 = y-r;
if((lx<=w)&&(lx2>=0)&&(ly<=h)&&(ly2>=0)){
cout <<"Yes\n";
}
else{
cout <<"No\n";
}
} | #include <iostream>
#include <string>
#include <cctype>
#include <vector>
using namespace std;
int transform(string str){
int num=0;
for(int j=0;j<str.length();j++){
if(isdigit((int)str[j])){
if(str[j+1]=='m') num += (str[j]-48)*1000;
else if(str[j+1]=='c') num += (str[j]-48)*100;
else if(str[j+1]=='x') nu... | 0 | 90,765,585 |
#include <bits/stdc++.h>
#define LL long long
#define pb push_back
#define st first
#define nd second
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
template <class T> T read(T &a) {
a=0;char x=getchar();bool f=0;
for(;x<'0'||x>'9';x=getchar())f|=x=='-';
for(;x>='0'&&x<='9';x=getchar())a=(a<<3)+(a<<1)+... | #include<bits/stdc++.h>
using namespace std;
int frog1(int N, int a[])
{
int dp[N+1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
dp[3] = min(dp[2] + abs(a[2]-a[1]) , abs(a[2]-a[0]));
for( int i = 3; i < N; i++)
{
dp[i+1] = min(dp[i] + abs(a[i]-a[i-1]), dp[i-1] + abs(a[i]-a[i-... | 0 | 64,928,743 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N), B(N);
vector<pair<ll, ll>> C(N);
rep(i, N) {
cin >> A[i] >> B[i];
C[i] = make_pair(- A[i] - B[i], A[i]);
}
sort(C.b... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vb = vector<bool>;
using vi = vector<int>... | 0 | 6,680,928 |
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | #include<bits/stdc++.h>
using namespace std;
int L[2010][2010],R[2010][2010],D[2010][2010],U[2010][2010];
int main(){
int h,w;
cin >> h >> w;
vector<string> s(h);
for(int i=0;i<h;++i){
cin >> s[i];
}
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
if(s[i][j]=='#'){
L[i][j]=0;
}else{
... | 0 | 67,999,593 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
const ll INF = LLONG_MAX/3;
int main(){
int n;
cin >> n;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
string S, T; cin >> S >> T;
int size = S.size();
vector<int> sc(30, 100);
vector<int> tc(30);
bool ok = true;
rep(i, size){
int s = S[... | 0 | 67,450,276 |
#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 pqueue(x) priority_queue<x,v... | #include <bits/stdc++.h>
using namespace std;
signed main(){
int N, M, i;
scanf("%d%d", &N, &M);
vector<int> H(N);
for(i = 0; i < N; i++){
scanf("%d", &H[i]);
}
vector<int> is_good(N, 1);
for(i = 0; i < M; i++){
int A, B;
scanf("%d%d", &A, &B);
A--;
B--;
if(H[A] <= H[B]){
is_good[A] = 0;
}
if(... | 0 | 63,803,104 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> P;
#define PI 3.141592653589793
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).end()
template<class T>inline bool chmax(T& a,T b){if (a<b){a=b;return 1;}return 0;}
template<class T>inline boo... | 0 | 23,357,866 |
#include <iostream>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define ll long long
int a[200005],b[200005];
int main(int argc, char** argv) {
int n;
scanf("%d",&n);
rep(i,1,n)
scanf("%d%d",&a[i],&b[i]);
ll ans=0,mx=1e18,fg=0;
rep(i,1,n)
{
if(a[i]<=b[i])
{
ans+=a[i];
if(a[i]<b[i])fg=1... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
usin... | 0 | 9,269,677 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | #include<bits/stdc++.h>
using namespace std;
#define double long double
#define int long long
#define ALL(x) x.begin(),x.end()
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define pb(x) push_back(x)
#define eb emplace_back
#define SORT(ls) sort(ls.begin(), ls.end())
#define DESC(ls) sort(l... | 0 | 16,584,685 |
#include <iostream>
using namespace std;
int main() {
int n, b, f, r, v, a[4][3][10] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
while (n--) { ... | #include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1e9;
int main() {
int n;
while(cin >> n, n) {
vector<vector<int>> d(10, vector<int>(10, INF));
for(int i=0; i<10; ++i) {
d[i][i] = 0;
}
for(int i=0; i<n; ++i) {
int a, b, c;
cin ... | 0 | 13,924,030 |
#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;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define... | 0 | 100,214,301 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | 0 | 36,024,372 |
#include<iostream>
#include<cstdlib>
#include<string>
#include<vector>
#include<map>
#include<unordered_map>
#include<queue>
#include<algorithm>
#include<iomanip>
#include<typeinfo>
#include<complex>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for(ll i = a;i < b; i++)
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
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; }
const int IN... | 0 | 39,658,222 |
#include<cstdio>
int main(){
int n,max,sum,t;
scanf("%d", &n);
while(n){
scanf("%d", &t);
max = sum = t;
if(sum < 0){
sum = 0;
}
for(int i = 1; i < n; i++){
scanf("%d", &t);
sum += t;
if(sum > max){
max = sum;
}
if(sum < 0){
sum = 0;
}
}
printf("%d\n", max);
scanf("%d", &... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
ll N, a, H = 0, W = 0;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
sort(A.begin(), A.end());
for(int i=N-1; i>=1; i--) {
if(A[i] == A[i-1]) {
... | 0 | 66,761,356 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,X,Y;
cin>>N>>M>>X>>Y;
int k=X,l=Y;
for(int i=0;i<N;i++){
int j=0;
cin>>j;
k=max(k,j);
}
for(int i=0;i<M;i++){
int j=0;
cin>>j;
l=min(l,j);
}
if(k<l)
cout<<"No War"<<endl;
else
cout<<"War"<<endl;
} | #include <iostream>
#include <algorithm>
#define N 100000
using namespace std;
int main(){
int n,k,in[N],maxv,sum,i;
while(1){
cin >> n >> k;
if(n==0&&k==0) break;
maxv=-2000000;
sum=0;
for(i=0;i<n;i++){
cin >> in[i];
sum+=in[i];
if(i>=k){
sum-=in[i-k];
}
if(i>=k-1... | 0 | 34,598,989 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main(){
int N; cin >> N;
vector<int> v(N);
rep(i,N){
int a; cin >> a;
v[i] = a;
}
ll res = (1LL<<60);
for(int a=-100;a<=100;a++){
ll s... | #include <iostream>
#include <queue>
#include <map>
using namespace std;
typedef pair<int, int> pii;
constexpr int MAX_SCALE = 1010;
constexpr int INF = 1000;
int height, width, max_search_num;
int sx, sy;
int gx, gy;
char maze[MAX_SCALE][MAX_SCALE];
int d[MAX_SCALE][MAX_SCALE];
int ans = 0;
int bfs(pii relay_pos, int ... | 0 | 29,774,924 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(3);
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
cout << a[2]*10+a[1]+a[0] << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define sayyes cout<<"Yes"<<endl;
#define sayno cout<<"No"<<endl;
using namespace std;
typedef long long ll;
const double PI=acos(-1);
typedef pair<int,int>P;
const int mod =1e9+7;
int main()
{
int n;
cin>>n;
vector<ll> a(n);
rep(i,n)cin>>a... | 0 | 49,840,668 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char a; cin >> a;
if(a <= 'Z') cout << 'A';
else cout << 'a';
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
string a, b;
cin >> a >> b;
if (a.size() < b.size())
{
cout << "LESS" << '\... | 0 | 66,807,992 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<long long> H(N + 1, 0);
for(int i=1; i<=N; ++i) cin >> H[i];
if(K == 0) {
long long res = H[1];
for(int i=2; i<=N; ++i) res += max(H[i] - H[i - 1], 0LL);
cout << res << endl;
} else {
... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 40,394,768 |
#include <iostream>
#include <cstring>
using namespace std;
int Pow(int a){
int ret = 1;
for(int i = 0; i < a; i++) ret *= 10;
return ret;
}
int main(){
int n;
cin >> n;
for(int v = 0; v < n; v++){
string s[2];
int t[2] = {0,0};
int x;
cin >> s[0] >> s[1];
for(int u = 0; u < 2; u++){
for(int i = 0; i... | #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n,m;
scanf("%d %d",&n,&m);
vector<int> coin(m);
for(auto&e:coin){
scanf("%d",&e);
}
int INF=1<<18, MAX_N=50001;
vector<int> dp_coin(MAX_N);... | 0 | 68,774,973 |
#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<limits>
#include<sstream>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const int inf... | #include <iostream>
#include <climits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <deque>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = ... | 0 | 4,993,309 |
#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 REV(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 << " = " << (x)... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#define rep(i,n) for(int i=0... | 0 | 1,310,450 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main(){
ll K;
... | #include<bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int maxn = 100010;
const int lim = (int)1e9;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL... | 0 | 36,909,548 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,a,b) for (int i = (a); i < (b); ++i)
int main(){
char a,b;
cin>>a>>b;
if(a=='H'){
if(b=='H') cout<< 'H' <<endl;
else cout<< 'D' <<endl;
}
else{
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<int>a(n);
ll allsum=0;
int tmp=0;
for(int i=0;i<n;i++){
cin>>a[i];
allsum+=abs(a[i]-tmp);
tmp=a[i];
}
allsum+=abs... | 0 | 10,098,983 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
#include<deque>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>... | 0 | 73,696,975 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include<bits/stdc++.h>
using namespace std;
#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>
#define mii map<int,int>
#... | 0 | 63,252,851 |
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
char c;
cin>>c;
c++;
cout<<c;
return 0;
} | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true... | 0 | 88,823,275 |
#include <bits/stdc++.h>
#define eps 1e-7
#define pi acos(-1.0)
#define inf 0x3f
#define INF 0x3f3f3f3f
#define pb push_back
#define debug1 cout<<"&&";
#define debug2 cout<<"**";
#define ms(a, x) memset(a, x, sizeof(a))
#define rep(i, a, b) for(int i = a; i <= b; ++i)
using namespace std;
typedef double db;
typedef lon... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
... | 0 | 71,946,192 |
#include<bits/stdc++.h>
#define ll long long int
#define vll vector<pair<ll, ll> >
#define vl vector<ll>
#define vi vector<int>
#define vii vector<pair<int, int> >
const ll mod = 1e9 + 7;
const ll inf = LLONG_MAX;
using namespace std;
ll power_mod(ll x, ll y, ll p)
{
ll ans = 1;
x = x%p;
if(x==0)
return p;
while(y... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> E(N);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
E[max(a - 1, b - 1)]++;
E[min(a - 1, b - 1)]--;
}
bool ans = true;
int now = E[N - 1];
for (int i = N - 2; i >= 0... | 0 | 56,578,079 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> flgs(n, 0);
rep(i, n){
cin >> a[i];
}
ll ans=0;
ll i = 1;
while(true){
if(flgs[i-1] == 1){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int a[100000];
int n;
cin >> n;
rep(i, n) cin >> a[i];
map<int, int> cnt;
rep(i, n) cnt[a[i]]++;
int ans = 0;
for (auto p : cnt) {
int x = p.first;
int n = p.sec... | 0 | 29,137,856 |
#include <iostream>
#include <bits/stdc++.h>
const int Size = 200005;
long long Arr1[Size], Arr2[Size];
using namespace std;
int main()
{
string S, T;
cin >> S >>T;
int c = 0;
for (int i=0; i < S.length(); i++){
if (S[i] != T[i]) c++;
}
cout <<c;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define vc vector<ll>
#define vpl vector<pair<ll, ll> > ... | 0 | 69,651,155 |
#include <iostream>
#include <cstring>
#include <cctype>
#include <cmath>
using namespace std;
int main() {
string number;
cin >> number;
long total = 0;
char cToStr[2];
cToStr[1] = '\0';
for (int i = 0; i < number.length(); i++) {
cToStr[0] = number[i];
total += atoi(cToStr);
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll ZERO = 0;
const int Inf = 1e9;
const ll INF= 1e18;
const ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
int main() {
int N;
cin >> N;
vector<tuple<ll,ll,ll>> vec(N);
for(int i = 0;i < N;i++) {
... | 0 | 8,027,533 |
#include<stdio.h>
int make_ans(int n,int x) {
int a,b,c,total=0;
for(a=1;a<=n;a++) {
for(b=a+1;b<=n;b++) {
for(c=b+1;c<=n;c++) {
if(a+b+c==x) total++;
}
}
}
return total;
}
int main() {
int n,x,i=0,k,limit=100,ans[limit];
while(1) {
... | #include <iostream>
#include <map>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#pragma warning (disable: 4996)
using namespace std;
int dat[10] = { 0,2,5,5,4,5,6,3,7,6 };
int N, M, A[1 << 18];
int dp[1 << 18];
int main() {
cin >> N >> M;
for (int i ... | 0 | 6,737,336 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
std::ios::sync_with_stdio(false);
int n, a;
cin >> n >> a;
cout << n * n - a << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fr(a,b) for(int i=a;i<b;i++)
#define prDouble(x) cout<<fixed<<setprecison(18)<<x
#define mod 1000000007
std::vector<int> tree[100001];
ll dp[100001][2];
int solve(int u, bool constraint, int pr)
{
if (dp[u][constraint] != -1... | 0 | 87,440,320 |
#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 vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long ll;
#define press_F_to_pay_respect ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define forn for(int i=0;i<n;i++)
#define fore(i,a,b) for(int i = a; i < (b); ... | 0 | 39,950,116 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
bool ans = s == "abc";
cout << (ans? "Yes" : "No") << endl;
} | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... | 0 | 70,118,866 |
#include <iostream>
using namespace std;
const int millennium = 196470;
int yearToDays(int y) {
return 590 * ((int)(y-1)/3) + 195 * ((y-1)%3);
}
int monthToDays(int y, int m) {
if (y % 3 == 0) {
return 20 * (m-1);
} else {
return 39 * ((int)(m-1)/2) + 20 * ((m-1)%2);
}
}
int main () {
... | #include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main(){
int N, A, B, C, X;
while(cin >> N >> A >> B >> C >> X, N != 0){
int flame = 0;
for(int i = 0; i < ... | 0 | 96,528,868 |
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int max = 0, t = 0;
vector<int> A(3, 0), abss(3, 0); cin >> A[0] >> A[1] >> A[2];
abss[0] = abs(A[0] - A[1]);
abss[1] = abs(A[1] - A[2]);
abss[2] = abs(A[2] - A[0]);
for(int i = 0; i < 3; i++) {
if(max < abss[i]) ma... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define RFOR(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define LL long long
#define INF INT_MAX/3
const double EPS = 1e-14;
const double PI = acos(-1.0);
clas... | 0 | 62,746,449 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
int rp = 0;
ll ans = 0;
ll sum = 0;
ll xsum = 0;
for ( int lp = 0; lp < n... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
ll N,K; cin>>N>>K;
vector<ll> A(N);
rep(i,N)
{
cin>>A.at(i);
}
rep(i,min(K,(ll)100))
{
vector<ll>... | 0 | 78,658,558 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | #include<bits/stdc++.h>
using ll=long long;
using namespace std;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T... | 0 | 58,431,172 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
struct RootedTree {
RootedTree(int n, int root = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 45,565,678 |
#include<iostream>
#include<vector>
using namespace std;
int n;
void countingSort(short A[],short B[],int k)
{
int C[k+1];
for(int i=0;i<k+1;i++)
{
C[i]=0;
}
for(int j=0;j<n;j++)
{
C[A[j]]++;
}
for(int i=1;i<k+1;i++)
{
C[i]+=C[i-1];
}
for(int j=n-1;j>=0;j--)
{
... | #include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <functional>
#include <random>
#define rep(i, n) for(int i = ... | 0 | 36,101,640 |
#include<bits/stdc++.h>
int n,m;
std::vector<std::vector<std::pair<int,int>>> hen;
std::vector<std::vector<int>> seen;
void dijkstra(int start){
std::vector<int> past(n, n + 5);
std::vector<int> dist(n,1000000000);
using T = std::pair<int, int>;
std::priority_queue<T, std::vector<T>, std::greater<T>> ... | #include <iostream>
using namespace std;
int main(void){
int a,b,c;
int num;
cin >> a >> b >> c;
if(a > b)
{
num = b;
b = a;
a = num;
}
if(b > c)
{
num = c;
c = b;
b = num;
}
if(a > b)
{
num = b;
b = a;
a... | 0 | 1,723,669 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<cmath>
#include<math.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<unordered_map>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rep2(i,n) for(int i = -1; i < (n); i++)
#define PI 3.141592653589793
using namespace std... | #include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<set>
#include<string>
typedef long long ll;
using namespace std;
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define rep(i, n) for(int i=0; i<(n); ++i)
int main()
{
int N, M; cin >> N >> M;
vector<int> P(M), Y(M);
for (int i = 0; ... | 0 | 33,350,261 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,a,b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar,val) memset(ar... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sidha(i,a,b) for(int i=a;i<b;i++)
#define vi vector<int>
#define pb push_back
#define mod 1000000007
int solve(int n){
int dp[n+1];
dp[0]=0;
dp[1]=1;
for(int i=2;i<n+1;i++){
dp[i]=(dp[i-1]+dp[i-2])%mod;
}
return dp[n];
}
int main(){
io... | 0 | 35,953,435 |
#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 <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> t(n);
for (int i = 0; i < n; i++) {
cin >> t[i];
}
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int t_sum = 0... | 0 | 82,168,739 |
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
vector<vector<int>> G(100);
vector<int> d(100);
const int INF = 1<<28;
void bfs(){
queue<int> Q;
Q.push(0);
fill(d.begin(),d.end(),INF);
d[0]=0;
while(!Q.empty()){
int u=Q.front();
Q.pop();
for(auto a:G[... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
string s; cin>>s;
ll n=s.si... | 0 | 27,136,213 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string A, B;
cin >> A >> B;
int a = A.size();
int b = B.size();
if (a == b)
{
int now = a;
for(int i = 0; i < now; i++) {
if(A.at(i) > B.at(i)) {
a = 3;
b ... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) f... | 0 | 12,409,501 |
#include <bits/stdc++.h>
using namespace std;
int N, S, cnt;
void dfs( int i, int sum, int total )
{
if( total == N && sum == S )
{
cnt++;
return;
}
if( i == 10 || total == N ) return;
dfs( i + 1, sum + i, total + 1 );
dfs( i + 1, sum, total );
}
int main()
{
while( cin >> N ... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; ++i)
int main() {
int n, m, p;
string s;
cin >> n >> m;
vector<bool> ac(n + 1);
vector<int> wa(n + 1);
int a = 0, b = 0;
REP(i, m) {
cin >> p >> s;
if (s == "AC") {
if (!ac[p]) {
++a... | 0 | 65,330,246 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<=(n);i++)
typedef long long ll;
int main() {
ll n;
cin>>n;
ll p[100];
ll ans=0;
p[0]=2;
p[1]=1;
for(int i=2;i<=n;i++){
p[i]=p[i-2]+p[i-1];
}
cout<<p[n]<<endl;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | 0 | 41,889,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.