code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
const int MOD=1e9+7;
vector... | #include <bits/stdc++.h>
using namespace std;
int main(){
int w, h, n; cin>>w>>h>>n;
int square[w][h];
for(int i = 0; i < w; i ++) {
for (int j = 0; j < h; j ++) {
square[i][j] = 0;
}
}
for(int i = 0; i < n; i ++) {
int x, y, a;
cin >> x >> y >> a;
switch (a)
... | 0 | 60,234,660 |
#include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(0)
typedef long long ll;
#define swap(x, y)((x)^=(y)^=(x)^=(y))
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> matrix;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
using pr = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<pr> t(n, {0,0});
int p;
string s;
rep(i, m) {
cin >> p >> s;
p--;
if (s == "AC") {
... | 0 | 45,084,000 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define srt(x) sort((x).begin(), (x).end())
#define rsrt(x) sort((x).rbegin(), (x).rend())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd... | #include <stdio.h>
#include <math.h>
#define MAX 1000000
int main(){
int mem[100000] = {2};
bool list[MAX]={true,true};
int set = 2,m = 1,j,x;
while( set < sqrt( MAX )){
for( int i = set;i < MAX;i++ ) if( i % set == 0 ) list[i] = true;
for( int i = set;i < MAX;i++ ) if( list[i] == false ){ set... | 0 | 13,881,010 |
#include<iostream>
#include<cstdio>
using namespace std;
long long n,m,h;
int main()
{
cin>>n>>m;
h=min(n,m/2);
m=m-n*2;n=0;
m=max(m,n);
cout<<h+m/4;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
struct node{
int val;
int pos;
}a[200010];
bool cmp(node a, node b){
return (a.val < b.val);
}
int n,cnt;
int main(){
ios::sync_with_stdio(0);
cin>>n;
for(int i=1; i<=n; i++){
cin>>a[i].val;
a... | 0 | 53,727,275 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
const int maxn=2e5+10;
const int mod=998244353;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll h,w;
cin>>h>>w;
if(h==1||w==1)
{
cout<<1<<'\n';
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int w, h, n;
cin >> w >> h >> n;
vector<vector<int>> a(n, vector<int>(3));
for (int i = 0; i < n; i++)
{
for (int k = 0; k < 3; k++)
{
cin >> a.at(i).at(k);
}
}
int x_max, x_min, y_max, y_min;
x_max = w;
x_min = 0;
y_max = ... | 0 | 10,093,921 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair ... | #include <bits/stdc++.h>
int main(){
int X, Y, Z, K;
std::cin >> X >> Y >> Z >> K;
std::vector< long long > A(X);
std::vector< long long > B(Y);
std::vector< long long > C(Z);
for(int i=0; i<X; i++){
std::cin >> A[i];
}
for(int i=0; i<Y; i++){
std::cin >> B[i];
}
... | 0 | 52,202,741 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a;
int d[5]={0};
for(int i=0;i<6;i++){
cin >>a;
d[a]++;
}
if(d[1]<=2&&d[2]<=2&&d[3]<=2&&d[4]<=2) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int N,a,b;
cin >> N >> a >> b;
vector<int> nums;
for(int i=1; i<=N; i++){
int temp = i;
deque<int> digit;
while(temp>0){
digit.push_front(t... | 0 | 56,157,580 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include<iostream>
using namespace std;
int main() {
int a, b[] = { 500,100,50,10,5,1 }, ruio = 0;
cin >> a;
while (a != 0) {
a = 1000 - a;
for (int i = 0; i < 5; i++) {
ruio += a / b[i];
a = a%b[i];
}
cout << ruio+a << endl;
cin >> a;
ruio = 0;
}
} | 0 | 47,498,933 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){
ll r;
if(b > a){
swap(a, b);
}
while((r = a % b)){
a = b;
b = r;
}
return b;
}
int main(){
ll n, x, a;
cin>>n;
cin>>x;
vector<ll> v;
for(int i=0; i<n; i++){
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(Array) sort(Array.begin(), Arra... | 0 | 35,427,469 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main(int argc, char* argv[]) {
int s, w;
cin >> s >> w... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int k[m];
vector<vector<int>> s(m);
for(int i=0;i<m;i++){
cin >> k[i];
s[i].resize(k[i]);
for(int j=0;j<k[i];j++){
cin >> s[i][j];
--s[i][j];
}
}
int ans=0;
vector<int> p(m);
for(int i=0;i<m;i... | 0 | 61,122,962 |
#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 <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int anscol = 0, ansrow = 0;
for (int i=0; i<H; i++) {
for (int j=0; j<W; j++) {
string s;
cin >> s;
if (s == "snuke") {
anscol = j;
ansrow = i + 1;
}
}
}
char c = (anscol%26) +... | 0 | 66,206,723 |
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
bool t = false;
while (n) {
if (n % 10 == 7) t = true;
n /= 10;
}
printf("%s\n", t?"Yes":"No");
return 0;
} | #include <cstdio>
#include <cctype>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int INF = 100000000;
const int MAX_N = 9;
const int MAX_H = 1000;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
int H, W, N;
P A[MAX_N + 1];
int d[MAX_H][MAX_H];
char field[MAX_H][MAX_H + 1];
int ... | 0 | 18,048,870 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 0;i<n;++i)
using ll = long long;
using P = pair<string,int>;
int main(){
int n;
cin >> n;
vector<int> l(2*n);
rep(i,2*n) cin >> l[i];
sort(l.begin(),l.end());
int ans = 0;
rep(i,2*n){
if(i%2 == 0){
ans += min(l[i],l[i+1]... | #include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace... | 0 | 46,337,689 |
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <cstdio>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i-... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAX = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, ans=0, tmp=0;
vector<ll> A, B;
map<ll,ll> M;
signed main(){
cin >> N;
for(int i=0;i<N;i++) {
ll a;
cin >> a;
A.push... | 0 | 10,469,555 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define FOR(i,start,sto... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
int main() {
long n, m;
pair<long, long> a[110000];
cin >> n >> m;
for(int i =... | 0 | 96,405,163 |
#include <bits/stdc++.h>
#define up(i,a,b) for(int (i) = (a);(i)<=(b);++(i))
#define down(i,b,a) for(int (i) = (b);i>=(a);--i)
#define debug(x) cerr << (x) << '\n';
#define bits(x,i) ((x >> i) & 1)
#define mid ((l+r)/2)
#define pr pair<int,int>
using namespace std;
const int LOG_N = 60;
const int N = 100005;
long long ... | #include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.be... | 0 | 58,638,974 |
#include<iostream>
using namespace std;
int coin[6] = {500,100,50,10,5,1};
int main(){
int money, price;
while(cin >> price){
if(price==0) break;
money = 1000-price;
int count=0;
for(int i=0; i<6; i++)
while(money>=coin[i]) {count++; money-=coin[i];}
cout << count << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int N; cin >> N;
vector<int> a(N); rep(i, N) cin >> a.at(i);
bool odd = (N%2==1);
vector<int> ans(N);
if(odd){
rep(i, N){
if(i%2==1){
... | 0 | 72,539,641 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
int st,en;
for (int i = 0; i < N; i++) {
cin >> st >> en;
sum+= en-st+1;
}
cout << sum << endl;
} | #include <cstdio>
typedef long long ll;
char qu[10];
int main()
{
int len = 1;
for (ll i = 10; len <= 10; i *= 10)
{
printf("? %lld\n", i );
fflush(stdout);
scanf("%s", qu);
if (qu[0] == 'N') break;
++len;
}
if (len == 11)
{
for (ll i = 9; i < 10000000000ll; i = i * 10 + 9)
{
printf("? %lld\n", i... | 0 | 90,732,385 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
const int MAXN = 1e5 + 4;
int main() {
int n;
string s;
cin >> n;
cin >> s;
s[n] = s[0], s[n + 1] = s[1];
bitset<100005> a;
REP(i, 4) {... | #define _USE_MATH_DEFINES
#include <stdio.h>
#include <math.h>
int main(void) {
int a, b, lC;
double lS, lL, h;
double cRad;
scanf("%d %d %d", &a, &b, &lC);
cRad = lC / 180.0 * M_PI;
lS = a * b * sin(cRad) / 2;
lL = a + b + sqrt(a * a + b * b - 2 * a * b * cos(cRad));
h = 2 * lS / a;
printf("%f\n%f\n%f\n", lS,... | 0 | 24,387,042 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v.begin(),v.end())
#define COUT(x) cout<<(x)<<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
const int A = 1e6+1;
vector<int> a(n);
vector<int> c(A);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
c.at(a.at(i))++;
}
bool pairwise = true;
for (int i = 2; i < A; i++) {
int cnt = 0;
f... | 0 | 684,239 |
#include <iostream>
#include <string>
using namespace std;
typedef long long LL;
void findzero() {
int ret = 1;
for (int i = 2; 2*i/2 == i; i *= 10) {
cout << "? " << i << endl;
string s;
cin >> s;
if (s == "Y") {
break;
}
else ret *= 10;
}
cou... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | 0 | 64,503,098 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include... | #include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y... | 0 | 98,010,277 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N,M;cin>>N>>M;
vector<int> vec(M);
for(int i=0;i<M;i++){
cin>>vec[i];
}
int sum=0;
for(int i=0;i<M;i++){
sum+=vec[i];
}
if(sum<=N){
cout<<N-sum<<endl;
}
else{
cout<<"-1"<<endl;
}... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T... | 0 | 45,865,159 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b,c;
int cnt=0;
cin>>a>>b>>c;
for(int i=1;i<=c;i++){
if(c%i==0 && a<=i && i<=b) cnt++;
}
cout<<cnt<<endl;
return 0;
} | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n;
vector<ll> a;
main(){
cin >> n;
a.resize(n);
for(int i=0;i<n;++i){
cin >> a[i];
}
ll ans = 0;
ll i =0;
ll j = 0;
ll teks = 0;
ll tekx = 0;
while(i<n){
while(j<n && teks+a[j] == (tekx^a[j]) ){... | 0 | 49,752,632 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
int main(){
long double x1,x2,y1,y2,d;
cin >> x1 >> y1 >> x2 >> y2;
d = powl(pow... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll>A(N);
map<ll, int>mp;
ll ans = 0;
rep(i, 0, N){
cin >> A[i];
... | 0 | 93,743,034 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
type... | #include <iostream>
#include <string>
#include <vector>
const int max_key_length = 12;
class Dictionary
{
std::vector<int> _keys;
int _char_to_id(char);
int _to_hash(std::string);
public:
Dictionary();
~Dictionary();
void insert(std::string);
bool find(std::string);
};
Dictionary::Dictionary... | 0 | 80,598,605 |
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<int, int> even_nodes(n, 1);
pair<int, int> odd_nodes(n / 2 + 2, n / 2);
for (int i = 0; i < m; ++i){
if (i % 2 == 0) {
cout << even_nodes.first-- << " " << even_nodes.second++ << endl;
} e... | #include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
#include<set>
#include<math.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N+10,0);
for(int i=0; i<N; i++){
cin >> A.at(i);
}
vector<int> res(N+10, 0);
int alltot=0;
... | 0 | 92,602,809 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = a; i < (b + a); i++)
#define W1 while (1)
#define COUT(x) cout << x << endl
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(),x.end()
#define P pair<int,int>
#define mod 1... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
typedef long long ll;
int main() {
ll N, K, S;
vector<ll>ans;
cin >> N >> K >> S;
for (int i = 0; i < K; i++) {
ans.push_back(S);
}
for ... | 0 | 71,848,480 |
#include<bits/stdc++.h>
typedef double D;
typedef long long int LL;
typedef long double LD;
#define ll long long int
#define OR ||
#define AND &&
#define nl '\n'
#define S string
#define inf INT_MAX
#define SQR(a) (a) *... | #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> s(N + 1);
for(int i = 2; i <= N; i++) {
int x = i;
for(int j = 2; j * j <= x; j++) {
if(x % j == 0) {
wh... | 0 | 50,692,526 |
#include<bits/stdc++.h>
#define ll long long
#define mod 838627288460106
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
fast_io
ll n,a,b,i,j,sum=0,tmp;
cin>>n>>a>>b;
for(i=1;i<=n;i++)
{
ll x=0;
tmp=i;
while(tmp>0)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T... | 0 | 99,217,942 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> Cij(H, vector<char>(W));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> Cij[i][j];
}
}
for(int i=0; i<2*H; i++){
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define... | 0 | 71,139,136 |
#include<iostream>
using namespace std;
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<queue>
#include<unordered_map>
#include<set>
#include<cmath>
#define mod 1000000007
#define inf 1000000000000000
#define int long long int
int prime[1000001];
void sieve()
{
prime[1]=1;
prime[0]=1;
i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main()
{
ll n,m;
cin>>n>>m;
ll broken[n+1]{};
ll temp;
for(ll i=0;i<m;i++)
{
cin>>temp;
broken[temp]++;
}
ll ways[n+1]{};
ways[0] = 1;
if(broken[1] == 0)
ways[1] = 1;
for(... | 0 | 82,360,797 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
int cnt1=0,cnt2=0;
int n=s.size();
string a,b;
rep(i,n){
if(i%2==0){
a+='0';
b+='1';
}
else {
a+='1';
... | #include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x << ": " << x << endl
#else
#define debug(x)
#endif
using namespace std;
typedef long long ll;
const int MAXN=2e5+7;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;... | 0 | 63,831,165 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | #include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int arr[200001];
int main()
{
int N;
cin >> N;
int temp;
int i;
int m ... | 0 | 14,494,632 |
#include <vector>
#include <set>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { cond ? puts("Yes") :... | #include<bits/stdc++.h>
using namespace std;
vector<int> v[100005];
int a[100005];
int dfs(int n , int p)
{
a[n] = 0;
for(int it : v[n])
{
if(it==p)
continue;
dfs(it , n);
a[n] ^= a[it]+1;
}
}
int main()
{
int n;
cin >> n;
for(int i = 1 ; i<n ; i++)
{... | 0 | 87,825,009 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=int64_t;
const int temp=1e5;
ll check[temp+1];
int main() {
int N; ll K; cin >>N >>K;
rep(i,0,N) {
int a,b; cin >>a >>b;
check[a]+=b;
}
rep_eq(ans,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 2005;
char s[N][N], t[4] = {'R', 'Y', 'G', 'B'};
int n, m, d;
void paint(int sx, int sy, int z, char letter) {
int k = sy, j = sx;
for (int i = 2; i <= z; i += 2, k--, j++) {
for (int... | 0 | 69,673,820 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typed... | #include <iostream>
#include <map>
using namespace std;
#define ll long long
const int MAX_N = 200009;
int N, A[MAX_N];
ll s[MAX_N];
map<ll, ll> M;
int main() {
s[0] = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
s[i+1] = s[i] + A[i];
}
for (int i = 0; i <= N; i++) {
... | 0 | 91,009,016 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n; cin>>n;
vector<int> h(n);
for(int i=0; i<n; ++i) cin>>h[i];
int cnt=0,left=0;
while(left<n){
while(h[left]==0) ++left;
for(int i=left; h[i]&&i<n; ++i) --h[i];
++cnt;
}
cout<<cnt-1<<endl;
return 0;
} | #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... | 0 | 56,094,112 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y; cin >> x >> y;
if (y % 2 == 0 && 2 * x <= y && 4 * x >= y) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 0 | 68,895,567 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int a[101] = { 0 };
int k;
int mex = 0;
while (cin >> k) {
a[k]++;
if (mex < a[k]) {
mex = a[k];
}
}
for (int i = 1; i <= 100; i++) {
if (a[i] == mex) {
cout << i << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fs first
#define se second
#define M 1000000007
#define pii pair<long long,long long>
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
unordered_map<char,pii>dir;
ll D=1e9;
bool check(ll x,ll y,ll n,ll m){
return (x>=0 && y>=0 &... | 0 | 90,013,750 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include<stdio.h>
#include<string.h>
int main()
{
char inp[11];
scanf("%s",inp);
int j=0;
char out[11]={'\0'};
int len = strlen(inp);
for(int i = 0; i < len; i++)
{
if(inp[i]=='0')
{
out[j]='0';
j++;
}
else if(inp[i]=='1')
{
out[j]='1';
j++;
}
else if(inp[i]=='B')
{
if(j!=0)
{
... | 0 | 39,455,996 |
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(n, 0);
for(int i = 0; i < n; i++) cin >> a[i];
for(int kk = 0 ;kk < min(k, 50); kk++)
{
vector<int> fre(n, 0);
for(int j = 0; j < n; j++)
{... | #include <bits/stdc++.h>
using namespace std;
int MOD = 1000000007;
int main(){
int N, K;
cin >> N >> K;
vector<int> a(N);
for (int i = 0; i < N; i++){
cin >> a[i];
a[i] = min(a[i], K);
}
vector<vector<int>> dp(N + 1, vector<int>(K + 1, 0));
dp[0][0] = 1;
for (int i = 0; i < N; i++){
for (in... | 0 | 55,532,639 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(n); i++)
#define ll long long
using namespace std;
int main() {
int n,m,d; cin>>n>>m>>d;
double res=1.0/n;
if (d!=0) res*=2.0*(n-d)/n;
res*=(m-1.0);
cout<<setprecision(10)<<res<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true... | 0 | 75,037,029 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
string n;
cin >> n;
if ((n.at(0) == n.at(1) && n.at(1) == n.at(2)) || (n.at(1) == n.at(2) && n.at(2) == n.at(3)))
cout << "Yes";
else
{
cout << "No";
}
} | #include<stdio.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long maxn = 3e5 + 7;
const long long mod = 1e9 + 7;
ll anss = 0,a[maxn];
struct Linear_Basis {
ll b[63], nb[63], tot;
bool flag = false;
void Init() {
tot = 0;
flag = false;
... | 0 | 37,117,083 |
#include <iostream>
#include <string>
using namespace std;
void solve(){
int l[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << l[K-1];
}
int main(){
solve();
} | #include <bits/stdc++.h>
using namespace std;
int count_div(int num) {
map<int, int> divs{
{3, 0},
{5, 0},
{7, 0},
{11, 0},
{13, 0}
};
int keys[] = {3, 5, 7, 11, 13};
for (int i = 0; i < 5; i++) {
while(num%keys[i] == 0) {
divs[keys[i]]++;
... | 0 | 57,221,145 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int N, A, surplus;
cin >> N >> A;
surplus = N % 500;
if (surplus <= A)
{
cout << "Yes" << endl;
}
else if (surplus > A)
{
cout << "No" << endl;
}
return (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(void){
int n, m;
cin>>n>>m;
map<int, int> mp;
rep(i, m){
int a, b;
cin>>a>>b;
mp[a]++;
mp[b]++;
}
bool ok = true;
for(auto p : mp){
if... | 0 | 19,775,654 |
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
int n;
std::vector<P> links[100010];
void dijkstra(int st, std::vector<ll> &dist){
std::priority_queue<P, std::vector<P>, std::greater<P>> que;
dist[st] = 0;
que.emplace(0, st);
while(!que.empty()){
ll dis, from;
std::tie(dis, from) = ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | 0 | 69,826,421 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main() {
int a,b,c; cin>>a>>b>>c;
int n; cin>>n;
int x,y,ans=0;
rep(x,n/a+1){
rep(y,n/b+1){
if(n >= a*x + b*y && (n-a*x-b*y) % c == 0){ans++;}
}
}
cout<<ans<<endl;
} | #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... | 0 | 72,423,275 |
#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 = 1e5 +... | #include<iostream>
#include<stdlib.h>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
string s;
string t;
cin>>s>>t;
int size_1=s.length();
int size_2=t.length();
int ans=2000;
int sen=0;
for(int i=0;i<=size_1-size_2;i++)
{
sen=0;
for(int... | 0 | 79,459,841 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int A,B,C;
cin >> A >> B >> C;
if(A+B>=C){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>... | 0 | 11,475,281 |
#include<bits/stdc++.h>
#define ln '\n'
#define sf scanf
#define pf printf
#define D(x) cout<< #x " = "<<x<<endl
#define cout(case) cout << "Case " << ++cs << ": " ;
#define foreach(i,c) for(__typeof(c.begin())i=c.begin();i!=c.end();i++)
#define f0(i,b) for(int i=0;i<(b);i++)
#define f1(i,b) for(int i=1;i<=(b);i++)
#... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
... | 0 | 85,043,050 |
#include <bits/stdc++.h>
#define fname "D"
#define bug(x) cerr << (#x) << " = " << (x) << endl
#define ll long long
#define REP0(i, n) for(int i = 0, _n = (n); i < _n; ++i)
#define REP1(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define REPB0(i, n) for(int i = (n) - 1; i >= 0; --i)
#define REPB1(i, n) for(int i = (n)... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | 0 | 17,923,754 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int count = 0;
int index;
for (int i = 2; i < S.size() - 1; i++) {
if(S[i] == 'C'){
count++;
index = i;
}
}
int up_count = 0;
for (int i = 1; i < S.size(); i++) {
if(i != index){
if(S[i] >= 'A' &... | #include <bits/stdc++.h>
#define ll long long int
#define forr(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define oo 100000000000000000
using namespace std;
bool pairWise(vector<int> &v){
unordered_map<int,int> m;
int n = v.size();
for(int i=n-1;i>=0;i--){
int x = v[i];
for(int j=2;j*j... | 0 | 35,643,847 |
#include <iostream>
using namespace std;
int main(void){
int H, W;
while (true) {
cin >> H >> W;
if (H == 0 && W == 0) break;
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
cout << '#';
}
cout << endl;
}
cou... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#define sz(s) (int)(s.size())
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
cons... | 0 | 57,208,512 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 20,473,538 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb()
{
fact[0] = fact[1] = 1;
... | #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)
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll MAXN = 802... | 0 | 59,584,312 |
#include <iostream>
#include <algorithm>
using namespace std;
int dp[21][50001];
int m, n;
int c[21];
void solve(){
for(int i=1; i<=n; i++){
dp[0][i]=i;
}
for(int i=1; i<m; i++){
dp[i][0]=0;
}
for(int i=1; i<m;i++){
for(int j=1; j<=n; j++){
if(c[i]<=j){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 0 | 30,252,470 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
int64_t sum=0;
int64_t kaz=0;
for(int i=0;i<(int64_t)S.size();i++){
if(S.at(i)=='W'){
sum+=i;
kaz++;
}
}
int64_t N=kaz-1;
cout<<sum-(N+1)*N/2<<endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstdlib>
#include <cmath>
#include<stdio.h>
#include<queue>
#define MAX 1000000000000000000LL
long long inf=1000000007;
using namespace std;
int H,A[2000001];
int main(){
string str;
priority_queue<int>PQ;
while(1){
... | 0 | 64,692,924 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
const int MAX=1000000;
int main()
{
ll t;
t=1;
while(t--)
{
string str;
cin>>str;
ll i=0;
if(str[i]>='A' && str[i]<='Z')cout<<"A"<<endl;
else cout<<"a"<<endl;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1 << 18;
const int LG = 18;
const int INF = 1e9 + 7;
pair <int, int> merge(pair <int, int> a, pair <int, int> b) {
vector <int> v = {a.first, a.second, b.first, b.second};
sort(v.begin(), v.end());
return {v[2], v[3]};
}
int... | 0 | 2,543,446 |
#include <iostream>
int main() {
int a;
int b;
int c;
std::cin >> a >> b >> c;
bool flag = false;
if(a < b) {
if(b < c) {
flag = true;
}
}
if(flag) {
std::cout << "Yes" << std::endl;
}
else {
std::cout << "No" << std::endl;
}
return 0;
} | #include<bits/stdc++.h>
#include<bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for(int i=st; i<ed; i++)
#define repn(i, st, ed) for(int i=st; i<=ed; i++)
#define repb(i, ed, st) for(int i=ed; i>=st; i--)
typedef long long ll;
typedef unsig... | 0 | 67,795,875 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1000000LL;
int main(){
int n;
while(true){
ll max = -INF, tmp = -INF, d;
cin >> n;
if(n == 0)break;
for(int i = 0; i < n; i++){
cin >> d;
tmp=(tmp+d > d ? tmp+d : d);
if(max<tmp)max=tmp;
}
cou... | #include <iostream>
using namespace std;
int main() {
int height[10];
for (int i = 0; i < 10; i++) {
cin >> height[i];
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < i; j++) {
if (height[j] < height[i]) {
int temp = height[j];
height[j] =... | 0 | 27,289,670 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using in6 = int64_t;
using ind = double;
using pii = pair<int,int>;
using psi = pair<string,int>;
using vpi = vector<pii>;
using vps = vector<psi>;
#define rep(i, n) for (in6 i = 0; i < (in6)(n); i++... | #include<iostream>
using namespace std;
int main()
{
float x1,y1,x2,y2,x3,y3,x,y,a,b,c;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3>>x>>y)
{
a=((y-y2)*(x-x1)-(y-y1)*(x-x2))*((y3-y2)*(x3-x1)-(y3-y1)*(x3-x2));
b=((y-y3)*(x-x2)-(y-y2)*(x-x3))*((y1-y3)*(x1-x2)-(y1-y2)*(x1-x3));
c=((y-y3)*(x-x1)-(y... | 0 | 65,297,042 |
#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--)
int main()
{
cin.tie(0);
ios_ba... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int a, b;
char sign[4];
cin >> a >> b ;
if(a < b){
strcpy(sign, "<");
}else if(a == b) {
strcpy(sign, "==");
}else {
strcpy(sign, ">");
}
printf("a %s b\n", sign);
retur... | 0 | 33,759,226 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
vector<int> g[100010];
bool used[100010];
int dfs(int now){
used[now]=true;
bool leaf=true;
int w... | 0 | 6,264,265 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int,int>;
typedef long long ll;
int main()
{
int n,k; cin >> n >> k;
vector<int> a(n);
int mini = 100001;
int ite;
rep(i, n)
{
cin >> a[i];
... | #include <bits/stdc++.h>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair... | 0 | 79,156,348 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <set>
#include <cmath>
#include <map>
#include <cstring>
#include <stack>
#include <cstdio>
#include <complex>
#include <iomanip>
#include <cctype>
#include <cassert>
#include <numeric>
#include <climits>
#include <de... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin... | 0 | 6,225,980 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int A[100001];
int MOD = 998244353;
ll powMod(ll x, ll k) {
if (k == 0) return 1;
if (k % 2 == 0)
return powMod(x * x % MOD, k / 2);
else
return x * powMod(x, k - 1) % MOD;
}
int main() {
int N;
cin >> N;
vector<int> D(N);
for (in... | #include<bits/stdc++.h>
using namespace std;
#define ms(a,v) memset(a,v,sizeof a)
#define lll long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Read freopen("input.txt", "r", stdin)
#define Write ... | 0 | 22,147,885 |
#include <iostream>
static const int INF = int(1e8);
using namespace std;
int dp[55555] = {};
int denom[55555] = {};
int main() {
int n; int m;
cin >> n; cin >> m;
for (int i = 0; i < m; i++) {
cin >> denom[i];
}
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = INF;
for (int j = 0; j <= m; j++... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
LL Z[51], Y[51];
LL part(int N, LL X) {
if (N == 0) { if (X == 0) return 0; else return 1; }
LL ans = 0;
if (X <= 1) return ans;
X--;
if (X <= Z[N - 1]) return... | 0 | 12,410,630 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int p, q;
cin >> p >> q;
if (p < q) cout << 0 << endl;
else cout << 10 << endl;
} | #include<bits/stdc++.h>
#define ford(i,a,b) for(int i=(a);i>=b;i--)
#define rep1(i,a,b) for(int i=(a);(i)<=(b);(i)++)
#define rep(i,a,b) for(int i=(a);(i)<(b);(i)++)
#define ll long long
#define N 105
#define pql priority_queue<ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define rev... | 0 | 56,164,629 |
#include <iostream>
using namespace std;
int Change(int *numA, int *numB);
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a > b)
{
Change(&a, &b);
}
if(a > c)
{
Change(&a, &c);
}
if(b > c)
{
Change(&b, &c);
}
cout << a << " " << b << " " << c << endl;
... | #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>0;i--)
#define repi(i,x) for(a... | 0 | 66,957,587 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
if(k == 1) cout << 0 << endl;
if(k != 1) cout << n-k << endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <tuple>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
cout << fixed << setprecision(15);
int N;
cin >> N;
vector<tuple<long double, long double, long double>> V(N);
for (int i = 0; i < N; i++){
int x, y;
cin >> x >> y;
... | 0 | 66,798,811 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;
signed main(){
while(1){... | 0 | 2,992,306 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | #include <iostream>
#include <vector>
#include <bitset>
using namespace std;
int n, k, d[40];
vector<long long> s, v;
int main(void){
cin >> n >> k;
s.assign(n+1, 0);
for(int i=1;i<=n;i++){
cin >> s[i];
s[i] += s[i-1];
}
fill(d, d+40, 0);
for(int i=1;i<=n;i++){
for(int j=... | 0 | 50,376,354 |
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(all(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define MP(x, y) make_pair(x, y)
#define SZ(x) int((x).size())
#define PB(x) push_back(x)
#define ll long long
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu", &x, &y, ... | 0 | 47,060,081 |
#include <stdio.h>
#include <stdbool.h>
#include <string.h>
int count = 0;
bool isConstruction[16][16];
int a,b;
void rec(int i, int j) {
if (isConstruction[i][j]) {
return ;
}
if (i == a && j == b) {
count += 1;
return;
}
if (i != a) {
rec(i+1, j);
}
if (j !=... | #include<bits/stdc++.h>
using namespace std;
vector<int>link;
vector<int>S;
int find(int x){
return link[x] = ((link[x]!=x)?find(link[x]):x);
}
void unite(int a, int b){
a = find(a);
b = find(b);
if(S[a]<S[b]){
swap(a,b);
}
S[a] += S[b];
link[b] = a;
}
void solve(int n, int q){
S... | 0 | 44,766,642 |
#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 pb push_bac... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 25,408,972 |
#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x,long long int y)
{
long long int res = 1;
while (y > 0)
{
if (y & 1)
res = (res*x);
y = y>>1;
x = (x*x);
}
return res;
}
long long int power(long long int x,long long... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) ... | 0 | 55,031,509 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 11,297,448 |
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
string str;
int n, digit_sum;
n = 0;
char c;
while(std::cin >> str){
n = str.length();
if(str[0] == '0'){
break;
}
digit_sum = 0;
for (int i=0; i<n; ++i){
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 0 | 35,200,504 |
#include <bits/stdc++.h>
#include <type_traits>
using namespace std;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int w,h,n;
cin>>w>>h>>n;
int x1=0,y1=0,x2=w,y2=h;
for(int i=0;i<n;i++){
int x,y,a;
cin>>x>>y>>a;
if(a==1)x1=max(x1,x);
else if(a==2)x2=min(x2,x);
else if(a==3)y1=max(y1,y);
else y2=min(y2,y);
}
if(x2-x1<=0||y2-y1<=0)cout<<0<<... | 0 | 8,261,582 |
#include <iostream>
using namespace std;
int main(){
int n, debt = 100000;
cin >> n;
for (int i = 1; i <= n; i++){
debt *= 105;
debt /= 100;
if (debt % 1000 > 0){
debt /= 1000;
debt++;
debt *= 1000;
}
}
cout << debt << "\n";
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | 0 | 78,640,703 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define forn(i, n) for(int i = 0; i < (int)n; ++i)
int main()
{
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int> v(n), w(m);
forn(i, n) cin >> v[i];
forn(i, m) cin >> w[i];
sort(v.begin(), v.end());
sort(w.begin(), w.end());
bool flag_1 = v... | #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, ... | 0 | 39,633,290 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int x=0;
for(int i = 0; i < s.size()-1; i++) {
if(s[i]!=s[i+1]) x++;
}
cout << x << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
int dia = a[0];
auto makePath = [] (int dia) {
vector<in... | 0 | 38,897,314 |
#include <algorithm>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
deque<char> q... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,k,r,s,p;
string t;
cin >> n >> k >> r >> s >> p >> t;
int i,a=0;
for(i=0;i<k;i++){
if(t.at(i)=='r'){
a += p;
}else if(t.at(i)=='s'){
a += r;
}else{
a += s;
}
}
for(i=k;i<n;i++){
if(t.a... | 0 | 39,544,946 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int f,n,m;
cin>>n;
m=n/2;
f=n%2;
string a,s,t;
cin>>a;
s=a.substr(0,m);
t=a.substr(m,n-m);
if(f==0)
{
if(s==t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
else
cout<<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
... | 0 | 64,576,040 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2>
inline void chmin(T1 &a, T2 b) {
if (a > b) a = b;
}
template <typename T1, typename T2>
inline void chmax(T1 &a, T2 b) {
if (a < b) a = b;
}
int main() {
Int n, m;
cin >> n >> m;
vector<Int> as(n), bs(n);... | #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 int long long
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#define mod 1000000007
#de... | 0 | 86,345,445 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int W, H, N;
cin >> W >> H >> N;
int x_begin = 0;
int x_end = W;
int y_begin = 0;
int y_end = H;
for (int i = 0; i < N; i++) {
int x, y, a;
cin >> x >> y >> a;
if (a == 1) {
x_begin = max(x_begin, x);
}... | #include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n, m;
cin >> n >> m;
int a[n], b[n];
int c[m], d[m];
rep(i, n) cin >> a[i] >> b[i];
... | 0 | 95,450,448 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
int main(){
ll N, K;
cin >> N >> K;
set<ll>S;
vector<P>v(N);
priority_queue<ll, vector<ll>... | #include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<iostream>
# define ll int64_t
# define rep(i,n) for(ll i=0;i<n;i++)
# define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
# define vec ve... | 0 | 69,664,732 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | 0 | 72,371,324 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int sen=0,maxe[2]={0,0},lo=0;
string str[1000],s;
while(cin>>s){
lo=s.size();
if(maxe[0]<lo){
maxe[0]=lo;
maxe[1]=sen;
}
str[sen]=s;
sen++;
}
int co=-1,num;
for(int i=0;i<=se... | 0 | 67,044,540 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<Edge>>;
int main(){
cin >> n >> m;
Graph G(n);
ll a[m];
ll b[m];
ll c[m];
ll dist[n][n];
for(ll i... | #include<iostream>
using namespace std;
int main()
{
long long n,m,mn,i,a,s=1;
cin>>n;
cin>>a;
mn=a;
for(i=2;i<=n;i++)
{
cin>>a;
if(a<mn)
{
s++;
}
mn=min(mn,a);
}
cout<<s<<endl;
return 0;
} | 0 | 100,403,102 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
... | #include <bits/stdc++.h>
using namespace std;
int N, A, B, C;
int l[8];
int dfs(int cur, int a, int b, int c)
{
if(cur == N){
if(min({a,b,c}) > 0){
return abs(a-A) + abs(b-B) + abs(c-C) - 30;
}else{
return 1e9+7;
}
}
int ret0 = dfs(cur+1, a, b, c);
int ret... | 0 | 11,865,855 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <algorithm>
#include <cmath>
using namespace std;
const int M = 100000;
const double pi = 3.141592653589;
int main()
{
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
printf("%.9f\n",sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2)));
return 0;
} | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PI 3.14159265358979323846264338327950L
#define PB push_back
#define MP make_pair
#define F first
#define S s... | 0 | 84,014,341 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
typedef... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
string s;
cin>>s;
bool f=true;
long long ans=0;
if(s[0]!='A'){
f=false;
}
f(i,2,s.size()-1){
if(s[i]=='C'){
ans++;
}
else if(s[i]-'a'<0){
f=... | 0 | 98,941,573 |
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
long long int arr[n], max = 1e18, res = 1, check = 0, zero = 0;
int c;
for (c = 0; c < n; c++) {
scanf("%lld", &arr[c]);
check = (arr[c] > max) ? 1 : check;
res *= arr[c];
(arr[c]) ? max /= arr[c] : zero = 1;
}
(zero) ? printf("0\n") ... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define int long long
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define ... | 0 | 16,897,068 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 1000000000;
int main()
{
ll t, n;
while( 1 )
{
scanf("%lld", &t);
if(t == 0) break;
ll c_max = -INF;
ll c_min = 0;
ll c_sum = 0;
for(int i=0; i<t; i++)
{
scanf("%lld", &n);
c_sum += n;
if(c_max < c_sum - c_min) c_max... | #include <bits/stdc++.h>
int main(){
int N, K;
std::cin >> N >> K;
std::vector< std::pair< int, int > > DT(N);
for(int i=0; i<N; i++){
std::cin >> DT[i].second >> DT[i].first;
DT[i].second--;
}
std::sort(DT.begin(), DT.end());
std::vector< bool > eat_type(N, false);
long ... | 0 | 30,634,224 |
#include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n;
cin >> n;
int ans = 0, cnt = 0;
int a[n];
rep(i, n) cin >>... | #include <iostream>
using namespace std;
int main()
{
int a,b,c,N=101;
cin >> a >> b >> c;
int color[N] = {};
color[a]++;
color[b]++;
color[c]++;
int sum=0;
for(int i=1; i<N; i++){
if(color[i] > 0){
sum++;
}
}
cout << sum;
} | 0 | 56,946,801 |
#include <bits/stdc++.h>
using namespace std;
bool need_mizuyari(int h[], int n) {
for ( int i = 0; i < n; i++ ) {
if ( h[i] > 0 ) { return true; }
}
return false;
}
int main() {
int n;
cin >> n;
int h[n];
for ( int i = 0; i < n; i++ ) { cin >> h[i]; }
int ans = 0;
while ( need_mizuyari(h, n) ) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define FOR(i, a, b) for (ll i = (a), i < (N): i++)
#define all(A) (A).begin(), (A).end()
int main(){
int N;
cin >> N;
int V[N];
re... | 0 | 75,230,507 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long ll;
typedef vector<ll> vll;
ll mod = 1e9+7;
int main() {
ll n;cin >> n;
vll a(n), t(n);
rep(i,n) cin>>a[i];
rep(i,n) cin>>t[i];
vll x(n,-1);
if(a[n-1] != t[0]) {
puts("0");
return 0;
}
x[0]=a[0]... | 0 | 62,753,986 |
#include<bits/stdc++.h>
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define int long long
using namespace std;
int ctoi(char c) {
switch (c) {
case '0': return 0;
case... | #include<bits/stdc++.h>
using namespace std;
const long long INF = 1000000000;
typedef long long ll;
#define writeln(n) cout<<n<<"\n";
typedef pair<int, int> P;
typedef pair<string, int> Psi;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r;cin>>r;
writeln(r*r);
} | 0 | 89,604,838 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.