code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <stdio.h>
#include <cmath>
using i64 = long long;
int main() {
i64 x, y; scanf("%lld%lld", &x, &y);
if(std::abs(x - y) <= 1) printf("Brown\n");
else printf("Alice\n");
return 0;
} | #include <iostream>
using namespace std;
int main()
{
long long x, y;
cin >> x >> y;
if (abs(x - y) <= 1)
cout << "Brown" << endl;
else
cout << "Alice" << endl;
return 0;
} | 1 | 53,029,652 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
... | #include <cstdio>
#include <list>
#include <algorithm>
using namespace std;
void printList(list<int> l){
int i = 0;
for (list<int>::iterator it = l.begin(); it != l.end(); it++){
if(i++) printf(" ");
printf("%d", *it);
}
printf("\n");
}
int main()
{
int n, val;
char order[12];
scanf("%d", &n);
l... | 1 | 95,644,018 |
#include <iostream>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
long long res=0;
for(int i=0;i<=N;i++){
int tmp=i, sum=0;
while(1){
sum+=tmp%10;
if(tmp/10 == 0) break;
else tmp/=10;
}
if(A<=sum && sum<=B) res+=i;
}
co... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
int ans=0;
for(int i=1;i<=n;i++){
int x=i;
int num=0;
while(x>0){
num+=x%10;
x/=10;
}
if(num>=a&&num<=b)ans+=... | 1 | 77,649,090 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){
int n;
ll x;
cin >> n >> x;
vector<ll> h(51),p(51);
h[0]=1; p[0]... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define M (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
l... | 1 | 57,450,604 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main () {
int a,b;
cin >> a >>b;
if (a ==1) {
if (a == b) cout << "Dr... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll a,b;
cin >> a >> b;
a=(a+11)%13;
b=(b+11)%13;
if(a<b) cout << "Bob" << endl;
else if(a>b) cout << "Alice" << ... | 1 | 32,604,200 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m1(x) memset(x,-1,sizeof(x))
const int INF = 1000000001;
const ll MOD = 1000000007;
int main(){
int n;
int table[300];
fill... | #include <bits/stdc++.h>
#include <math.h>
#include <vector>
#include <queue>
#include <iomanip>
#include <string>
#include <algorithm>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep_1 (i,j,n) for(int i=j;i<n;i++)
typedef long long ll;
typedef long l;
const ll ... | 1 | 4,173,797 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[20],n,s,h;
string v;
main()
{
a[0]=1;
for(int i=1;i<=15;i++)
a[i]=a[i-1]*10;
s=0;
for(int i=10;i>=1;i--)
{
int check = a[i]-1;
cout << "? " << check << "\n";
fflush(stdout);
cin >> v;
if(v == "N")
{
s = i+1;
break;
... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 1 | 60,163,417 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 200003
#define MOD 1000000007
int main(){
int N;
cin>>N;
vector<pair<double,pair<ll,ll>>> xy(N);
for(int i=0;i<N;i++){
ll x,y;
cin>>x>>y;
xy.at(i).second.first=x;
xy.at(i).second.second... | #include <bits/stdc++.h>
using namespace std;
pair<long, long> x[111];
long s[111], t[111];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
x[i] = { a,b };
if (!a && !b) i--, n--;
}
sort(x, x + n, [](auto a, auto b) {
if (a.second >= 0 && b.second <= 0 && (a.second ||... | 1 | 83,350,964 |
#include <bits/stdc++.h>
using namespace std;
using llong = long long int;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int MOD = 1000000007;
const static int IN... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 2005
#define INF 1000000005
#define INFLL (long long)1e18
#define PI 3.1415926535897
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<end... | 1 | 41,236,239 |
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <cstring>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <s... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
priority_queue<long long> pq;
int main(){
long long n;
cin>>n;
cout<<50<<endl;
for(long long i=1;i<=50;i++){
cout<<n/50 + (50-i) + (n%50>(i-1))<<" ";
}
} | 1 | 38,168,866 |
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long int;
constexpr ll k_max = 100000;
int main() {
ll K;
cin >> K;
deque<ll> dq{};
array<ll, k_max> costs{};
costs.fill(numeric_limits<ll>::max());
costs.at(1) = 1;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define Would
#defi... | 1 | 47,454,768 |
#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;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(void) {
string s;
cin >> s;
int i = 0, tmp;
bool key = false;
while(1) {
tmp = i;
if(0 == s.compare(i,11,"dreamer... | 1 | 98,028,966 |
#include<bits/stdc++.h>
using namespace std;
int n,a[100];
int main()
{
cin>>n;
int maxn=-998244353,minn=998244353;
for(int i=0;i<n;i++)
{
cin>>a[i];
maxn=max(maxn,a[i]);
minn=min(minn,a[i]);
}
long long g1=998244353,g2;
int i;
for(i=minn;i<=maxn;i++)
{
g2=0;
for(int j=0;j<n;j++)
{
g2+=(a[j]-i)*... | #include <iostream>
using namespace std;
int main(void){
int n;
cin >> n;
int nums[n];
int sum=0;
for(int i=0; i<n;i++){
cin >> nums[i];
sum+=nums[i];
}
int med = sum/n;
int ans = n*100000;
for(int m=med-10; m <= med+10; m++){
int res=0;
for(int e : nums){
int x = e - m;
res+=x*x;
}
ans = min(ans,... | 1 | 30,506,106 |
#include <bits/stdc++.h>
using namespace std;
int main (){
int cont=1;
bool band = false;
string s;
int pos;
cin >> s;
for (int i=1;i<4; i++){
if (s[i] == s[0]) cont++;
else if (!band){
pos = i; band = true;
}
}
if (cont == 2){
for(int j=pos+1; j<4; j++){
if (s[pos] == s[j]){
cout << "Yes";
... | #include "iostream"
#include "string"
using namespace std;
int main(){
string s;
cin>>s;
int d=0;
for(int i=0;i<4;i++){
if(s[i]==s[0]){
d++;
}
}
if((d==3)||((d==1)&&(s[1]==s[2]==s[3]))){
cout<<"Yes"<<endl;
}
else if((d==2)){
string h[2];
int y=0;
for(int i=1;i<4;i++){
... | 1 | 56,639,039 |
#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... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
struct mint {
int n;
m... | 1 | 99,902,470 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double D = 0.0;
for (int i = 0; i < N; i++) {
int O;
cin >> O;
D += 1.0 / O;
}
cout << 1.0 / D << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long double> a(n);
for(int i = 0; i < n; i++){
cin >> a.at(i);
}
for(int i = 0; i < n; i++){
a.at(i) = 1.0/a.at(i);
}
long double sum = 0;
for(int i = 0; i < n; i++){
sum += a.at(i);
}
cout << (long doub... | 1 | 65,414,935 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | #include <iostream>
#include <string>
using namespace std;
int main(void){
int a,b;
string x;
cin >> a >> b;
if(a>=b){
for(int i=0;i<a;i++) cout << b;
}
if(a<b){
for(int i=0;i<b;i++) cout << a;
}
return 0;
} | 1 | 82,916,684 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef unsigned long long ull;
typedef vector<int> vi;
const int MX=2e5+5;
#define f(i,x,n) for(int i=x;i<n;i++)
#define pb push_back
#define endl "\n"
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
int main()
{
ios_base::sync_with_stdio(... | #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;
int main()
{
int n, k, x, y;
cin >> n >> k >> x >> y;
int ans = 0;
if(n > k){
... | 1 | 28,738,939 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < B) {
if (A == 1) {
cout << "Alice" << endl;
return 0;
}
cout << "Bob" << endl;
} else if (A > B) {
if (B == 1) {
cout << "Bob" << endl;
return 0;
}
cout << "Alice" << en... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | 1 | 13,387,966 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
using ll = long long;
using pii = pair<int, int>;
using Vi = vector<int>;
int main() {
char a,b;
cin >> a>>b;
if(a=='H'&&b=='H'||a=='D'&&b=='D') cout << 'H' << endl;
else cout << 'D' <... | #include <bits/stdc++.h>
#define endl '\n'
#define db double
#define ld long double
#define ll long long
#define ull unsigned long long
#define sqr(x) (x) * (x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a/gcd(a,b)) * b)
#define pf(x) push_front(x)
#define pb(... | 1 | 32,241,323 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
int ans;
if (n % k == 0) ans = 0;
else ans = 1;
cout << ans << endl;
return 0;
} | 1 | 77,330,707 |
#include <iostream>
int main() {
int n;
std::cin >> n;
int room[5][4][11] = {};
for (int i = 0; i < n; i++) {
int b, f, r, v;
std::cin >> b >> f >> r >> v;
room[b][f][r] += v;
}
for (int b = 1; b < 5; b++) {
for (int f = 1; f < 4; f++) {
for (int r = 1; r < 11; r++) {
std::cout... | #include <iostream>
using namespace std;
main(){
int count[4][3][10], b,f,r,v,n;
cin >> n ;
for( int i=0;i<4;i++){
for(int j=0;j<3;j++){
for(int k=0;k<10;k++){
count[i][j][k]=0;
}
}
}
for( int i=0; i<n ; i++){
cin >> b >> f >> r >> v ;
count[b-1][f-1][r-1] += v;
}
for(b=0;b<4;... | 1 | 4,657,534 |
#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;
int main() {
int grid_n;
int paint_a;
cin >> grid_n >> paint_a;
cout << pow(grid_n, 2) - paint_a << endl;
} | 1 | 68,799,775 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin>>n;
ll a[n+1];
ll k=1;
std::vector<ll>v ;
for(ll i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]==k)
{
v.push_back(k);
k++;
}
}
if(v.size()==0)
{
cout<<"-1\n";
}
else
{
cout<<n-v.si... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int cnt = 0, N = 1;
rep(i,n) {
int a;
cin >> a;
if(a == N) N++;
else cnt++;
}
if(cnt == n) cout << -1 << endl;
else cout << cnt << endl;
return... | 1 | 5,839,899 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string tarou, hanako;
int a,tp=0,hp=0;
cin>>a;
for (int i=0; i<a; i++) {
cin>>tarou>>hanako;
if (tarou<hanako) {
hp+=3;
}else if(hanako<tarou){
tp+=3;
}else{
hp+=1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int n;
cin >> n;
int taro = 0, hanako = 0;
for (int i = 0; i < n; ++i) {
string s1, s2;
cin >> s1 >> s2;
if (s1 == s2) { ++taro, ++hanako; }
else if (s1 > s2) { taro += 3; }
else { hanako +=... | 1 | 90,725,010 |
#include <algorithm>
#include <cstdio>
#include <map>
typedef long long ll;
using namespace std;
int n, k, a[200000], sum[2000010];
long long ans = 0;
map<int, ll> m;
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
a[i] %= k;
sum[i + 1] = sum[i] + a[i];
sum[i + ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> arr(n);
for(int& x : arr) cin >> x;
vector<int> sum(n+1);
map<int, int> freq;
ll ans = 0;
freq[0] = 1;
for(int L = 0, R = 1; R <= n; R++) {
whi... | 1 | 70,068,271 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define SCANF(i) int i;scanf("%d",&i)
using namespace std;
using P = pair<int,int>;
const long long INF = 1LL << 60;
const int IINF=100000000;
const int MOD = (int)1e... | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005
ll mod(ll a){
ll c=a%... | 1 | 88,455,219 |
#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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = m; i < n; ++i)
int main() {
int H, W; cin >> H >> W;
vector<vector<string>> S(H,vector<string>(W));
rep(i, 0, H) rep(j, 0, W) cin >> S[i][j];
rep(i, 0, H) rep(j, 0, W) {
if(S[i][j] == "snuke") {
cout << char('A' + j) << (... | 1 | 76,015,290 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long s;
cin >> s;
int v = 1000000000;
int x = (v - s % v) % v;
int y = (s + x) / v;
cout << "0 0 1000000000 1 " << x << ' ' << y << '\n';
} | 1 | 6,182,490 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A,B,C;
cin>>A>>B>>C;
bool ans=false;
if(A+B>=C){
ans=true;
}
if(ans){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
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... | 1 | 62,517,856 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
cout << N % K << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
if(k==1 || n-k<0) cout<<0<<endl;
else cout<<n-k<<endl;
} | 1 | 64,163,847 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
int main()
{
int a, b;
cin >> a >> b;
if (a <= b)
cout << "unsafe" << endl;
else
cout << "safe" << endl;
return 0;
} | 1 | 46,228,465 |
#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;
int main() {
cin.tie(0);
ios::sync_with_stdio(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(sdk) sdk.begin(),sdk.end()
#define mll map<int, int>
#define pb push_back
#define rep(i,a,b) for(int i=a;i<b;++i)
#define repd(i,a,b) for(int i=a;i>=b;--i)
#define mp make_pair
#define hell 1000000007
#define endl '\n'
#... | 1 | 49,890,694 |
#include<bits/stdc++.h>
const int N=1e5+5;
int a[N];
int main()
{
int n,ai;
scanf("%d",&n);
while(n--)
{
scanf("%d",&ai);
a[ai]++;
a[ai-1]++;
a[ai+1]++;
}
int max=0;
for(int i=0;i<N-1;i++)
{
if(max<a[i])
{
max=a[i];
}
}
printf("%d",max);
} | #include <cstdio>
#include <map>
using namespace std;
const int MAX = 1e5+10;
int a[MAX];
map<int, int> mp;
int main(){
mp.clear();
int n; scanf("%d", &n);
for (int i = 0; i < n; i++){
scanf("%d", &a[i]);
mp[a[i]]++;
mp[a[i]-1]++;
mp[a[i]+1]++;
}
int k = 0, mx = 0;
... | 1 | 63,846,362 |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
int main(){
int N, a;
cin >> N;
int ans = 101;
vector<int> vec(N);
for (int i = 0; ... | #include <iostream>
#include <numeric>
using namespace std;
int n;
int main() {
cin >> n;
int arr[n];
for (int i=0; i<n;i++){
cin >> arr[i];
}
int total;
const size_t size = sizeof(arr) / sizeof(arr[0]);
total = accumulate(arr, arr + size, 0);
int left_sum = 0;
int right_sum;... | 1 | 58,194,653 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
ll fun(const Vl& B, ll b) {
ll res = 0;
for (... | #include<bits/stdc++.h>
#define int long long
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define REP_sz(i,s) for(int i=0;i<s.size();i++)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define pb push_back
#define sz(a) a.size()
#define V vector
#define ld long double
#define viit(a)... | 1 | 5,902,974 |
#include <bits/stdc++.h>
using namespace std;
string join(const vector<int>& v, const char* delim = 0) {
string s = to_string(v[0]);
for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
if (delim) s += delim;
s += to_string(v[i]);
}
return s;
}
int main() {
int N;
cin >> N;
vector<int> vec(N... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | 1 | 78,123,794 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rep2(i,s,t) for(int i = s; i <= t; ++i)
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 1e6 + 34;
int main()
{
ll c = 1000;
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i + 1 < n; i++)
{
if (a[i] < a... | 1 | 89,810,410 |
#include <stdio.h>
#include <string.h>
int main(){
char a[11], b[11], c[11];
scanf("%s %s %s", a, b, c);
int lenA = strlen(a);
int lenB = strlen(b);
int lenC = strlen(c);
if (a[lenA-1] == b[0] && b[lenB-1] == c[0]){
printf("YES\n");
}
else {
printf("NO\n");
}
return 0... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | 1 | 85,512,198 |
#include <iostream>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M;
unordered_map<int64_t, int64_t> count;
int64_t sum = 0;
count[sum]++;
rep(i, N) {
int a;
ci... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 1 | 19,645,198 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, X, T;
cin >> N >> X >> T;
int count = N / X;
if (N % X != 0)
{
count++;
}
cout << count * T << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,x,t;
cin >> n >> x >> t;
int amari;
amari = n % x;
int a;
a = (n - amari) / x;
int ans =0;
ans = a * t;
if (amari == 0){
cout << ans << endl;
}
else{
ans = ans + t;
cout << ans << endl;
}
} | 1 | 76,583,810 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
using namespace std;
int main() {
int k,s,cnt = 0;
cin >> k >> s;
for(int i = 0; i <= k; i++) {
for(int j = 0; j <= k; j++) {
if(0 <= (s-i-j) & (s-i-j) <= k)
cnt++;
}
}
cout << cnt << endl;
} | #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... | 1 | 61,858,290 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string O, E;
cin >> O >> E;
const int64_t L = static_cast<int64_t>(O.length());
for (int64_t i = 0; i < L; ++i) {
cout << O[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main(){
string S1, S2; cin >> S1 >> S2;
rep(i,... | 1 | 46,792,941 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
const ll maxi =20000;
#define ip pair<ll,ll>
#define mp make_pair
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int x,n;
cin>>x>>n;
bool a[1000];
for(int i=1;i<=1000;i++)
a[i]=false;
for(int i=0;i<n;i++){
... | #include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
long long X, N, P[1 << 18];
long long V[1 << 18];
int main() {
cin >> X >> N;
for (int i = 1; i <= N; i++) { cin >> P... | 1 | 13,047,333 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>; using vpii = vector<pii>;
using vi = vector<int>; using vvi = vector<vi>;
using ll = long long;
using pll = pair<ll, ll>; using vpll = vector<pll>;
using vll = vector<long long>; using vvll = vector<vll>;
template <class T> using min_queue = prio... | 1 | 92,719,487 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | #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 n;
string s;
cin >> n >> s;
int ans = 0;
rep(x, 1000) {
vector<int> v;
int nx = x;
v.push_back(nx % 10);
nx /... | 1 | 87,906,584 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W, A, B;
cin >> H >> W >> A >> B;
for (int i = 0; i < B; i++) {
for (int j = 0; j < A; j++) {
cout << 0;
}
for (int j = A; j < W; j++) {
cout << 1;
}
cout << endl;
}
for (int i = B; i < H; i++) {
for (int... | #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... | 1 | 19,808,939 |
#include <bits/stdc++.h>
#define ll long long int
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(n) for (int i = 0; i < n; ++i)
#define REP(i,k,n) for (int i = k; i <= n; ++i)
#define REPR(i,k,n) for (int i = k; i >= n; --i)
using namespace std;
int cnt[1000005],a[1000005];... | #include<bits/stdc++.h>
#define fint register int
#define h 5001
#define p 1437984
using namespace std;
int a[p],c[p];
inline void fj(int x);
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
int maxxs=0;
for(fint i=1;i<=n;i++)
cin>>a[i],maxxs=max(a[i],maxxs);
int now=a[1];
for(fint i=2;i<=n;i++)
now=__... | 1 | 32,705,946 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | 1 | 82,646,156 |
#include <stdio.h>
int main(){
int a,b,c,tmp;
scanf("%d %d %d",&a,&b,&c);
if(a>b){
tmp=a;
a=b;
b=tmp;
}
if(a>c){
tmp=a;
a=c;
c=tmp;
}
if(b>c){
tmp=b;
b=c;
c=tmp;
}
printf("%d %d %d\n",a,b,c);
return 0;
} | #include<iostream>
using namespace std;
int main(void)
{
int a,b,c,max=0,half=0,min=0;
cin>>a>>b>>c;
if(a<=b && a<=c) min=a;
else if(b<=a && b<=c) min=b;
else min=c;
if(b<=a && c<=a) max=a;
else if(a<=b && c<=b) max=b;
else max=c;
if((b<=a && a<=c) || (c<=a && a<=b)) half=a;
else if((a<=b && b<=c) || (c<=b &&... | 1 | 32,717,793 |
#include <iostream>
#include <fstream>
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i, n) FOR(i,0,(n))
class BDigitalGifts {
public:
void solve(std::istream &in, std::ostream &out) {
int n;
in >> n;
vector<... | #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);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n;
cin >> n;
double ans = ... | 1 | 33,532,715 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define FORL(i,x) for(int i=head[x];i;i=nxt[i])
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin... | 1 | 56,182,037 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mod... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int X,Y;
cin >> X >> Y;
cout << X + (Y/2) << endl;
return 0;
} | 1 | 3,593,211 |
#include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main(){
int h,w;cin>>h>>w;
vector<vector<char>> v(h,vector<char>(w));
rep(i,h){
rep(j,w){cin>>v.at(i).at(j);}
}
string ans="Yes";
bool a1,a2,a3,a4;
r... | 1 | 75,020,342 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
float t,x;
cin>>t>>x;
cout<<t/x<<endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
#define debug(var) cout << "[" << #var << "] " ... | 1 | 20,350,747 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int h,w;
cin>>h>>w;
string c[h];
for (int i=0;i<h;i++){
cin>>c[i];
}
for (auto ci:c){
cout<<ci<<endl;
cout<<ci<<endl;
}
} | #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... | 1 | 30,021,391 |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long lon... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<int,int>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll ... | 1 | 93,675,997 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = ve... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | 1 | 42,680,388 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int k, n, x, y; cin >> k >> n;
vector<int> a(n);
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
if (i == 0) continue;
d.at(i - 1) = a.at(i) - a.at(i - 1);
}
d.at(n - 1) = a.at(0) + (k - a.at(n - 1));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k, n, a1, b, m = 0;
cin >> k >> n;
for(int i = 0;i < n;i++) {
if(i == 0) {
cin >> a1;
b = a1;
} else {
int a;
cin >> a;
if(a - b > m) m = a - b;
b = a;
if(i == n - 1 && a1 + k - a > m) m = a1 + k - a;
... | 1 | 25,705,799 |
#include <iostream>
#include <stdio.h>
#include <utility>
#define MAX_N 100
void select_sort(int*,int);
void bubble_sort(int*,int);
int A[MAX_N];
int count = 0;
int n;
int d[MAX_N];
char c[MAX_N];
struct card
{
char c;
int d;
int initial_index;
} card[MAX_N];
struct card_s
{
char c;
int d;
int i... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
int N = 0;
cin >> N;
string in[N];
string out[N];
for(int i = 0; i < N; ++i){
cin >> in[i];
out[i] = in[i];
}
for(int i = 0; i < N; ++i){
for(int j = N - 1; j > i; --j){
if(out[j].at(1) < out[j - 1].at(1)){
str... | 1 | 83,390,318 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main(int argc, char *argv[])
{
int a=0, b=0, c=0;
scanf("%d %d %d", &a, &b, &c);
if(a<b && b<c)
cout << "Yes";
else
cout << "No";
cout << endl;
return 0;
} | #include<cstdio>
int main(){
int n,m,l;
scanf("%d %d %d",&n,&m,&l);
printf("%s\n",(n<m && m<l)?"Yes":"No");
} | 1 | 90,373,939 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double a , b;
cin >> a >> b;
double c;
c= a/b ;
cout << c << endl;
} | #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()
{
int t, x;
cin >> t >> x;
cout << (double)t / x << '\n';
return 0;
} | 1 | 1,378,983 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf INT_MAX
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps... | 1 | 28,644,480 |
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int cnt[12] = {1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049};
int dp[100005];
signed main() {
int N;
cin >> N;
for... | 1 | 8,419,214 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
const int INF = 0x3f3f3f3f, N = 2e3 + 5;
const ll... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | 1 | 81,274,331 |
#include <iostream>
using namespace std;
int main() {
int n,ban = 0;
while(true){
cin >> n;
ban += 1;
if(n == 0){
break;
}
cout << "Case " << ban << ":" << " " << n << endl;
}
return 0;
} | #include <stdio.h>
int main(void) {
int count;
int input;
count = 0;
scanf("%d", &input);
while(input != 0) {
count++;
printf("Case %d: %d\n", count, input);
scanf("%d", &input);
}
return 0;
} | 1 | 32,918,668 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s,c,x;
int y,a,b;
cin >> s >> y;
for(int t=0;t < y;t++){
cin >> c >> a >> b;
if(c == "print"){
cout << s.substr(a,b-a+1) << endl;
}else if(c =="reverse"){
string k =s.substr(a,b-a+... | #include<stdio.h>
#include<string.h>
int main(){
int n,i,k,a,b,q;
char str[1000];
char order[10];
scanf("%s",str);
scanf("%d",&q);
for(n=0;n<q;n++){
scanf("%s",order);
scanf("%d %d",&a,&b);
if(strcmp(order,"print")==0){
for(i=a;i<=b;i++){
printf("%c",str[i]);
}
printf("... | 1 | 16,938,464 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
int N = S.size();
map<char, int> M;
for (int i = 0; i < N;i++)
{
M[S[i]]++;
}
for (int i = 0; i < N;i++)
{
if(M[S[i]] != 2){
cout << "No" << endl;
return 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
map<char, int> mp;
rep(i,s.size()) {
mp[s[i]]++;
}
if (mp.size() == 2 && mp.begin()->second == 2 && next(mp.begin(... | 1 | 64,409,471 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n, l;
cin >> n >> l;
string ans="";
vector<string> s(n);
rep(i,n) cin >> s[i];
sort(all(s));
rep(i,n) ans+=s[... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define vi vector<ll>
#define pb push_back
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define pii pair<ll,ll>
#define vii vector<pii>
#defin... | 1 | 30,911,067 |
#pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
const int inf=1e18;
inline int in(){int x;scanf... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<vector<pair<int, int>>> edge(N + 1,
vector<pair<int, int>>());
int a, b, c;
for (int i = 0; i < N - 1; i++) {
scanf("%d %d %d", &a, &b, &c);
edge[a].insert(edge[a].end(), make_pair(b... | 1 | 26,810,712 |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <set>
#include <string>
#include <functional>
#include <cassert>
#include <cmath>
#define SIZE 200005
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
c... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ... | 1 | 16,272,035 |
#include<iostream>
using namespace std;
int main(){
int d;
while(cin >>d){
int solve = 0;
for(int i=d; i<600; i+=d)
solve += d*i*i;
cout <<solve<<endl;
}
return 0;
} | #include <iostream>
int main(){
int d;
while(std::cin >> d){
int squ;
int sum_heights = 0;
for(int i = 0; i < 600; i = i + d){
sum_heights = sum_heights + (i * i);
}
squ = d * sum_heights;
std::cout << squ << std::endl;
}
return 0;
} | 1 | 19,043,148 |
#include<bits/stdc++.h>
const long long mod = 1e9 + 7;
int main(){
int n; std::cin >> n;
if(n < 3){
std::cout << 0;
return 0;
}
std::vector<long long> arr (n+1); arr[0] = 1;
for(int i = 0; i <= n; ++i){
if(arr[i] == 0) continue;
for(int num = 3; i+num <= n; ++num){
arr[i+num] += arr[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const int mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
#define N_MAX 201010
ll f[N_MAX],rf[N_MAX];
ll mod... | 1 | 7,050,027 |
#include<bits/stdc++.h>
using namespace std;
#define ikarus_101 ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typed... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long n, t, i, ans = 0;
cin >> n >> t;
vector<long> time(n);
for (i = 0; i < n; i++)
{
cin >> time.at(i);
}
for (i = 0; i < n - 1; i++)
{
if (t + time.at(i) > time.at(i + 1))
{
ans += time.at(i ... | 1 | 18,288,267 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <map>
#include <vector>
#include <iomanip>
using namespace std;
int main(void) {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int f = 0;
int c = 0;
for (int i = 0; i < N - 1; i++) {
i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n; cin >> n;
vector<int> a(n);
for (auto &i : a) cin >> i;
... | 1 | 27,770,461 |
#include <stdio.h>
#include <iostream>
#include <string>
using namespace std;
#define N_MAX 50000
#define M_MAX 20
#define NIL 1000000000
int DP[N_MAX + 1][M_MAX + 1];
int C[M_MAX + 1];
int main(void){
int n, m;
scanf("%d %d", &n, &m);
for(int i = 1; i <= m; i++){
scanf("%d", &C[i]);
}
for(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll (i)=0;(i)<(ll)(n);(i)++)
#define rept(i,n) for(ll (i)=0;(i)<=(ll)(n);(i)++)
#define reps(i,s,n) for(ll (i)=(s);(i)<(ll)(n);(i)++)
#define repst(i,s,n) for(ll (i)=(s);(i)<=(ll)(n);(i)++)
#define repr(i,n) for(ll (i)=(n);(i)>=0;(i)--)
#define each(itr,... | 1 | 20,817,030 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
long long arr[60];
long long res;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin>>n;
for(long long i=1;i<=n;i++){
cin>>arr[i];
}
for(long long i=1;i<=100000;i++){
for(long long j=... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "... | 1 | 5,205,058 |
#include"bits/stdc++.h"
using namespace std;
#define ll long long
#define mod 1000000007
string solve() {
int n;cin>>n;
string s; cin >> s;
if(n&1) {
return "No";
}
for(int i=0;i<n/2;++i) {
if(s[i]!=s[i+n/2]) return "No";
}
return "Yes";
}
int main() {
ios_base::sync_with_stdio(false);
cout << solve();
r... | #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 ... | 1 | 60,258,957 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#defi... | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "/home/v-o_o-v/deb.h"
#define deb(x...)cerr << "[" << #x << "] = [";_print(x);
#else
#define deb(x...)
#endif
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).r... | 1 | 34,424,085 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int n;
long long money = 1000;
cin >> n;
vector<int> a(n);
rep(i, n)
{
cin >> a.at(i);
}
rep(i, n - 1)
{
if (a.at(i) < a.at(i + 1))
{
long long x = money / a.at(i);
m... | #include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int day_length;
vector<int> values;
cin >> day_length;
for(int i = 0; i < day_length; i++){
int v;
cin >> v;
values.push_back(v);
}
long long money = 1000;
for(int i = 1; i < day_length; i++){... | 1 | 15,994,586 |
#include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x)... | #include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#defin... | 1 | 19,702,024 |
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
using pii = pair<int, int>;
using pll = pair<lli, lli>;
using Double = long double;
template<typename T>
using Vector = vector<vector<T>>;
template<typename T>
using Prior = priority_queue<T>;
template<typename T>
using prior = priority_queue<T, vecto... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,l,x=-1;
cin >> n >> l;
vector<long> a(n);
for(long i=0;i<n;i++) cin >> a[i];
for(long i=1;i<n;i++) if(a[i-1]+a[i]>=l) x=i;
if(x==-1) cout << "Impossible" << endl;
else {
cout << "Possible" << endl;
for(long i=n-1;i>x;i--) cout << i ... | 1 | 26,785,100 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define FOR(i,j,n) for (int i=(int)(j);i<(n);i++)
#define REP(i,n) for (int ... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | 1 | 70,138,342 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
inline int toInt(string s) {int v; istringstream sin(s);sin>>v; return v;}
typedef long long ll;
typedef vect... | #include <iostream>
#include <string>
#include <cctype>
#include <map>
using namespace std;
int to_num_from_mcxi(string inp);
string to_mcxi_from_num(int num);
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string x1, x2;
int num1, num2;
num1 = num2 = 0;
cin >> x... | 1 | 46,914,112 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
#define READINT(X) if(ci-cn+16>cm){while((ct=readchar())>='0')(X)=(X)*10+ct-'0';}else{while((ct=*ci++)>='0')(X)=(X)*10+ct-'0';}
using namespace std;
typedef int_fast64_t ll;
u... | #include "bits/stdc++.h"
#include <unordered_set>
#include <numeric>
#define rep(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb... | 1 | 90,356,768 |
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
int main(){
int N;
cin >> N;
pair<int, int> red[N], blue[N];
for(int i=0; i<N; i++){
int a, b;
cin >> a >> b;
red[i] = {b, a};
}
for(int i=0; i<N; i++){
int c, d;
cin >> c >> d;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
typedef long long ll;
typedef long double ld;
typedef pai... | 1 | 22,427,096 |
#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define For(i,a,b) for(int i=a,i##E=b;i<=i##E;++i)
#define rFor(i,a,b) for(int i=a,i##E=b;i>=i##E;--i)
using namespace std;
typedef long long LL;
template<t... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | 1 | 33,895,977 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
#define INF (1<<30)-1
using namespace std;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(a... | #include <algorithm>
#include <boost/optional.hpp>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | 1 | 5,958,696 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | #include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define all(v) v.begin(), v.end()
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define THINK_TWICE_CODE_ONCE cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
#define isOdd(n) (n&1)
#defi... | 1 | 58,265,822 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int end = s.size() % 2 == 0 ? s.size() - 2 : (s.size() - 1);
int half = end / 2;
int ans = 0;
while (end > 0){
if(s.substr(0, half) == s.substr(half, half)) break;
end -= 2;
half = ... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
string s;
cin >> s;
bool flg;
for (int delta = (s.length() - 1) / 2; delta > 0; delta--)
{
flg = true;
fo... | 1 | 4,550,024 |
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<numeric>
#include<vector>
#include<cmath>
#include<set>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d, 0));
for(int i = 0; i < n; ++i) {
for(int j = 0; j < d; ++j) {
cin >> x[i][j];
}
}
int... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
int main()
{
using namespace std;
int n, d;
cin >> n >> d;
auto x = vector<vector<int>>(n, vector<int>(d,0));
for(int i=0; i<n; i++)
for(int j=0; j<d; j++)
cin >> x[i][j];
int c=0;
for(int i=0; i<n; ... | 1 | 34,353,282 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
const int INF = 1000000001;
int main(){
char a, b;
cin >> a >> b;
if(a<b){
cout << "<" <<endl;
}else if(a == b){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
char X,Y;cin>>X>>Y;
if(X==Y)cout<<'='<<endl;
else if(X<Y)cout<<'<'<<endl;
else cout<<'>'<<endl;
} | 1 | 68,910,607 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n... | 1 | 75,230,403 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | 1 | 68,156,846 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main() {
int n;
cin >> n;
int ans=0;
if(n<105){
cout << ans << endl;
return 0;
}
else{
for(int i=105;i<=n;i=i+2){
int t=0;
for(int j=1;j<=pow(i,0.5);j++){
if(i%j==0)
t++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int cnt = 0;
for (int i = 1; i <= N; i += 2) {
int divisors = 0;
for (int k = 1; k <= i; k++) {
if (i % k == 0) divisors++;
}
if (divisors == 8) cnt++;
}
cout << cnt << endl;
} | 1 | 33,065,076 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<b;i++)
#defin... | #include <iostream>
#include <cstdio>
using namespace std;
int n, m, x[10];
int c[10]={0,2,5,5,4,5,6,3,7,6};
string d[10005];
string f(string p, string q) {
if(p.size()>q.size() || p.size()==q.size() && p>q) return p;
return q;
}
int main() {
int i, j, t;
cin >> n >> m;
while(m--) {
cin >> t;
x[c[t]] = max(x[c... | 1 | 24,142,765 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static const int MAX = 10000;
int solve_coin_changing1(vector<int> coins, int target) {
vector<vector<int>> com = {{0}};
com.push_back(coins);
bool data[50000] = {false};
for (int n = 2; n <= 10000; n++) {
vect... | #include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int p[50001],a[20];
int main(){
int n,m,i,j;
cin>>n>>m;
for(i=0;i<m;i++)cin>>a[i];
for(i=1;i<=n;i++)p[i]=50000;
p[0]=0;
for(i=0;i<n;i++){
for(j=0;j<m;j++){
if(n>=i+a[j])p[i+a[j]]=min(p[i+a[j]],p[i]+1);
}
}
cout<<p[n]<<endl;
return 0;
} | 1 | 55,379,471 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
string b;
cin>>b;
int c=1;
for(int i=1;i<n;i++){
if(b[i-1]!=b[i]){
c++;
}
}
cout<<c;
return 0;
} | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 1 | 55,417,909 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int dis(int l, int r, const vector<P> &A) {
return abs(A[l].first - A[r].first) + abs(A[l].second - A[r].second);
}
int mai... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
map<int,PII> a;
int s[100100];
int b[100100];
int main()
{
int h,w,d,i,m,j,l,r,q;
cin >> h >> w >> d;
for(i = 0; i < h; i ++)
{
for(j = 0; j < w; j ++)
{
scanf("%d",&m);
a[m] = {i,j};
... | 1 | 67,911,169 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int N, M;
while(cin >> N >> M && (N|M)) {
P ps[N];
for(int i=0; i<N; i++) {
cin >> ps[i].second >> ps[i].first;
ps[i].first = -ps[i].first;
}
sort(ps, ps+N);
for(int i=0; i<N; i++) {
ps[i].firs... | #include <algorithm>
#include <iostream>
#include <utility>
#include <functional>
#include <map>
#include <vector>
#include <string>
using namespace std;
int
main() {
int n,m;
do {
cin >> n >> m;
if (n == 0 && m == 0) break;
vector<pair<int, int> > dp;
for (int i=0;i<n; ++i) {
int dx, px;
... | 1 | 20,407,375 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.