code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 200005
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
res = 0;T f = 1;char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 +c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
int D,N,a[MAXN],cnt[MAXN];
void Solve() {
read(N);
for(int i = 1 ; i <= N ; ++i) {read(a[i]);cnt[a[i]]++;}
for(int i = 1 ; i <= N ; ++i) D = max(D,a[i]);
if(D & 1) {
if(cnt[D / 2 + 1] != 2) {puts("Impossible");return;}
int res = 0;
for(int i = D / 2 + 1 ; i <= D ; ++i) {
res += cnt[i];
if(cnt[i] < 2) {puts("Impossible");return;}
}
if(res != N) {puts("Impossible");return;}
}
else {
if(cnt[D / 2] != 1) {puts("Impossible");return;}
int res = 1;
for(int i = D / 2 + 1 ; i <= D ; ++i) {
res += cnt[i];
if(cnt[i] < 2) {puts("Impossible");return;}
}
if(res != N) {puts("Impossible");return;}
}
puts("Possible");return;
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
Solve();
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long int N;
std::cin >> N;
std::vector<long long int> A(N + 1);
for (long long int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
std::vector<long long int> B(N);
for (long long int i = 0; i < N; i++) {
std::cin >> B[i];
}
long long int count = 0;
for (long long int i = N - 1; i >= 0; i--) {
if (A[i + 1] >= B[i]) {
count += B[i];
B[i] = 0;
} else {
count += A[i + 1];
B[i] -= A[i + 1];
}
count += std::min(A[i], B[i]);
A[i] = std::max(A[i] - B[i], 0ll);
}
std::cout << count << std::endl;
}
| 0
| 74,510,123
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
int xl[n], yl[m];
for (int i = 0; i < n; i++)
cin >> xl[i];
for (int i = 0; i < m; i++)
cin >> yl[i];
sort(xl, xl+n);
sort(yl, yl+m);
if (xl[n-1]<yl[0] && x<yl[0] && y>xl[n-1])
cout << "No War" << endl;
else
cout << "War" << endl;
}
|
#include <bits/stdc++.h>
int main()
{
int a, b, c;
bool ans = false;
std::cin >> a >> b >> c;
for (int i = 1; i <= b; ++i) {
if ((a * i) % b == c) {
ans = true;
}
}
if (ans) {
std::cout << "YES" << std::endl;
} else {
std::cout << "NO" << std::endl;
}
}
| 0
| 54,892,040
|
#include<bits/stdc++.h>
using namespace std;
inline void print() {
cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest) {
cout << first << ' ';
print(rest...);
}
void solve() {
int N; cin >> N;
vector<long long> A(N+1), B(N);
for (int i = 0; i < N+1; i++) cin >> A[i];
for (int i = 0; i < N; i++) cin >> B[i];
long long ans = 0;
long long help = 0;
for (int i = 0; i < N; i++) {
if (A[i] > help + B[i]) {
ans += help + B[i];
help = 0;
}
else{
ans += A[i];
if (A[i] <= help) help = B[i];
else help = help + B[i] - A[i];
}
}
ans += min(help, A[N]);
cout << ans << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define debug(s) cout << #s << " = " << s << endl
#define all(v) (v).begin(), (v).end()
#define mem(a,val) memset(a, val, sizeof a)
#define maxn 200010
#define INF 1e15
#define ff first
#define ss second
#define endl '\n'
typedef long long ll;
int n;
int arr[maxn];
int b[maxn][25], cum[maxn][25];
bool check(int l, int r) {
for (int i = 0; i <= 22; ++i) {
if (cum[r][i] - cum[l - 1][i] > 1) return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> arr[i];
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= 22; ++j) {
if (arr[i] & (1 << j)) b[i][j] = 1;
}
}
for (int j = 0; j <= 22; ++j) {
for (int i = 1; i <= n; ++i) cum[i][j] = cum[i - 1][j] + b[i][j];
}
ll ans = n;
for (int i = 1; i <= n; ++i) {
ll lo = 0, hi = n - i, res = 0;
while (lo <= hi) {
int mid = (lo + hi) >> 1;
if (check(i, i + mid)) {
res = mid;
lo = mid + 1;
}
else hi = mid - 1;
}
ans += res;
}
cout << ans << endl;
}
| 0
| 64,953,275
|
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
int k;
cin >> k;
queue<long long> que;
for(int i = 1; i < 10; i++) que.push(i);
int num = 0;
while(!que.empty()){
long long now = que.front();
que.pop();
num++;
if(num == k){
cout << now << endl;
return 0;
}
if(now%10 != 0){
que.push(10*now + now%10 -1);
}
que.push(10 * now + now%10);
if(now%10 != 9){
que.push(10 * now + now%10 +1);
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string str;
cin >> str;
int q;
cin >> q;
for(int i=0; i<q; i++){
string s;
cin >> s;
if(s=="print"){
int a, b;
cin >> a >> b;
for(int j=a; j<=b; j++){
cout << str[j];
}
cout << endl;
}
else if(s=="reverse"){
int a, b;
cin >> a >> b;
for(int j=a, k=b; j<k; j++, k--){
swap(str[j], str[k]);
}
}
else if(s=="replace"){
int a, b;
cin >> a >> b;
string p;
cin >> p;
for(int j=a, k=0; j<=b; j++, k++){
str[j] = p[k];
}
}
}
return 0;
}
| 0
| 86,315,799
|
#include<iostream>
using namespace std;
int main(){
int x;
int y;
int z;
cin >> x >> y>>z;
if (x<y&&y<z){
cout << "Yes\n";
}else{
cout << "No\n";
}
return 0;
}
|
#include <iostream>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>
using namespace std;
using ll = long long;
constexpr ll INF = 1010000000000000017LL;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
ll GCD(ll a, ll b) { if(b==0) return a; else return GCD(b, a%b); }
ll LCM(ll a, ll b) { return a/GCD(a,b)*b; }
class BNotFound {
public:
void solve(std::istream& in, std::ostream& out) {
string s;in>>s;
vector<ll> v(26,0);
rep(i,s.size()){
v.at(s.at(i)-'a')++;
}
rep(i,26) {
if(v.at(i)==0){
out<<(char)('a'+i)<<endl;
return;
}
}
out<<"None"<<endl;
}
};
int main() {
BNotFound solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 0
| 94,113,541
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = 1e9;
const ll LLINF = 1e18;
const ll MOD = 1e9+7;
const double EPS = 1e-10;
const double PI = acos(-1);
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; }
int main() {
int n, k; cin >> n >> k;
vector<pll> v(n);
rep(i, n) cin >> v[i].first >> v[i].second;
vector<ll> xs, ys;
rep(i, n) {
xs.push_back(v[i].first);
ys.push_back(v[i].second);
}
sort(all(xs)); sort(all(ys));
ll ans = (xs[n-1] - xs[0]) * (ys[n-1] - ys[0]);
for (int yi = 0; yi < n; yi++) {
for (int yj = yi+1; yj < n; yj++) {
for (int xi = 0; xi < n; xi++) {
for (int xj = xi+1; xj < n; xj++) {
int cnt = 0;
rep(i, n) {
ll x = v[i].first;
ll y = v[i].second;
if (xs[xi] <= x && x <= xs[xj] &&
ys[yi] <= y && y <= ys[yj]) {
cnt++;
}
}
if (cnt >= k) {
ll tmp = (xs[xj] - xs[xi]) * (ys[yj] - ys[yi]);
chmin(ans, tmp);
}
}
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(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 all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pl(s) cout << (s) << "\n";
#define pls(...) {bool space = false; for(auto i : __VA_ARGS__) (cout << (space?" ":"") << i), space = true; cout << "\n";}
#define plexit(s) {cout << (s) << "\n"; exit(0);}
#define yes(s) cout << ((s)?"Yes":"No") << "\n";
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using ll = long long; using ull = unsigned long long; using ld = long double;
template<typename T = int> using V = vector<T>; template<typename T = int> using P = pair<T, T>;
using Vi = V<int>; using Vl = V<ll>; using Vd = V<ld>; using VVi = V<Vi>; using VVl = V<Vl>; using Pi = P<int>; using Pl = P<ll>; using Pd = P<ld>;
constexpr ll MOD = 1000000007; constexpr int INF = (1 << 30) - 1; constexpr ll INFL = 1LL << 60; constexpr ld EPS = 1e-12; constexpr ld PI = 3.141592653589793238462643383279;
int main(void) {
VVi a(3, Vi(3)); rep(i,3) rep(j,3) cin >> a[i][j];
int n; cin >> n;
rep(q,n) {
int b; cin >> b;
rep(i,3) rep(j,3) {
if (a[i][j] == b) a[i][j] = -1;
}
bool ok = true;
rep(i,3) if (a[i][0] != -1) ok = false;
if (ok) plexit("Yes")
ok = true;
rep(i,3) if (a[i][1] != -1) ok = false;
if (ok) plexit("Yes")
ok = true;
rep(i,3) if (a[i][2] != -1) ok = false;
if (ok) plexit("Yes")
ok = true;
rep(j,3) if (a[0][j] != -1) ok = false;
if (ok) plexit("Yes")
ok = true;
rep(j,3) if (a[1][j] != -1) ok = false;
if (ok) plexit("Yes")
ok = true;
rep(j,3) if (a[2][j] != -1) ok = false;
if (ok) plexit("Yes")
ok = true;
if (a[0][0] != -1 || a[1][1] != -1 || a[2][2] != -1) ok = false;
if (ok) plexit("Yes")
ok = true;
if (a[0][2] != -1 || a[1][1] != -1 || a[2][0] != -1) ok = false;
if (ok) plexit("Yes")
}
pl("No")
return 0;
}
| 0
| 9,874,428
|
#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;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
string ans="";
ll n=s.length();
ll i0=0,i1=n-1;
ll num=0;
while(i0<i1){
if(s[i0]=='x'){
if(s[i1]=='x'){
i0++;
i1--;
}
else{
i0++;
num++;
}
}
else{
if(s[i1]=='x'){
i1--;
num++;
}
else{
if(s[i0]==s[i1]){
i0++;
i1--;
}else{
cout << -1<<endl;
return 0;
}
}
}
}
cout << num<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main()
{
int n;
cin >> n;
vector<string> A(n);
REP(i, n) cin >> A[i];
int B[26]={0};
FOR(i,'a','z'+1){
int MIN = INF;
REP(j,n){
int cnt = 0;
REP(k,A.at(j).size()){
if(A.at(j).at(k)==i){
cnt++;
}
}
MIN = min(MIN,cnt);
}
B[i-'a']=MIN;
}
FOR(i,'a','z'+1){
REP(j,B[i-'a']){
char x = i;
cout << x;
}
}
cout << endl;
}
| 0
| 86,982,986
|
#include<iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <iomanip>
#include<math.h>
#include <functional>
#include<climits>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<(ll)(n); ++i)
#define mod 1000000007
vector<ll>to[1000005];
int main(){
string a;cin>>a;
for(ll i=0;i<a.size();i+=2)cout<<a[i];
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef pair<int,ll> p;
typedef pair<pii,int> P;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const int MAXN=100000;
const int MAXE=100000;
const int MAXV=10000;
const ll INF=2e18;
const ll MOD=1e9+7;
int gcd(int a,int b){
if(b==0) return a;
return gcd(b,a%b);
}
int main(){
int n,k;cin>>n>>k;
vector<int> a(n);
for(int i=0;i<n;++i) cin>>a[i];
bool ok=false;
int g=a[0];
for(int i=0;i<n;++i) g=gcd(g,a[i]);
for(int i=0;i<n;++i){
if(k>a[i]) continue;
if((a[i]-k)%g==0){
cout<<"POSSIBLE"<<endl;
return 0;
}
}
cout<<"IMPOSSIBLE"<<endl;
return 0;
}
| 0
| 79,131,213
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#define int long long
const long long inf=1e18;
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long > > vpll;
typedef vector<pair<int, int > > vpii;
#define FORR(x,arr) for(auto& x:arr)
#define ZERO(a) memset(a,0,sizeof(a))
int dp[100031][2];
int mo = 1000000007;
void solve(){
ins(morty);
dp[0][1] = 1;
FOR(i,0,morty.size()){
if(morty[i] == '1'){
dp[i+1][1] = (dp[i][1]*2)%mo;
dp[i+1][0]+=dp[i][1];
dp[i+1][0]+=(dp[i][0]*3)%mo;
dp[i+1][1]%=mo;
dp[i+1][0]%=mo;
}
else{
dp[i+1][1] = dp[i][1];
dp[i+1][0] = (dp[i][0]*3)%mo;
dp[i+1][1]%=mo;
dp[i+1][0]%=mo;
}
}
out((dp[morty.size()][1]+dp[morty.size()][0])%mo);
}
int32_t main() {
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
string s,t;
cin>>s>>t;
int n = s.size();
int m = t.size();
if(n<m)
{
cout<<"UNRESTORABLE"<<endl;
return 0;
}
bool ans = false;
for(int i=n-m;i>=0;i--)
{
bool found = true;
for(int j=0;j<m;j++)
{
if(s[i+j]=='?')
{
continue;
}
if(s[i+j]!=t[j])
{
found = false;
break;
}
}
if(found)
{
ans = true;
for(int j=0;j<m;j++)
{
s[i+j] = t[j];
}
break;
}
}
if(!ans)
{
cout<<"UNRESTORABLE"<<endl;
return 0;
}
else
{
for(int i=0;i<n;i++)
{
if(s[i]=='?')
{
s[i]='a';
}
}
cout<<s<<endl;
return 0;
}
}
| 0
| 88,798,528
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long k,a,b;
cin >> k >> a >> b;
if(b-a>2){
if(k<=a)cout << k+1 << endl;
else{
cout << b + (b-a)*((k-a-1)/2) + (k-a+1)%2 << endl;
}
}
else{cout << k+1 << endl;}
return 0;
}
|
#include<iostream>
using namespace std;
int main() {
int m, f, r;
while(cin >> m >> f >> r, m!= -1||f!= -1||r!= -1) {
if(m == -1 || f == -1) cout << 'F';
else if(m + f >= 80) cout << 'A';
else if (m + f >= 65) cout << 'B';
else if (m + f >= 50) cout << 'C';
else if (m + f >= 30) {
if(r >= 50) cout << 'C';
else cout << 'D';
}
else cout << 'F';
cout << endl;
}
}
| 0
| 60,101,941
|
#include<iostream>
#include<algorithm>
#include<queue>
const int INF = 100000000;
using namespace std;
typedef pair<int, int> P;
char a[1005][1005];
int N, M;
int sx, sy;
int gx, gy;
int d[1005][1005];
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
int bfs()
{
queue<P> que;
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
d[i][j] = INF;
que.push(P(sx, sy));
d[sx][sy] = 0;
while (que.size())
{
P p = que.front();
que.pop();
if (p.first == gx&&p.second == gy)
break;
for (int i = 0; i < 4; i++)
{
int nx = p.first + dx[i];
int ny = p.second + dy[i];
if (nx >= 0 && nx < N&&ny >= 0 && ny < M&&a[nx][ny] != 'X'&&d[nx][ny] == INF)
{
que.push(P(nx, ny));
d[nx][ny] = d[p.first][p.second] + 1;
}
}
}
return d[gx][gy];
}
int main(void)
{
while (cin >> N >> M)
{
int n, sum = 0;
cin >> n;
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
cin >> a[i][j];
for (int j = 0; j < N; j++)
for (int k = 0; k < M; k++)
if (a[j][k] == 'S')
{
sx = j;
sy = k;
}
for (int j = 0; j < N; j++)
for (int k = 0; k < M; k++)
if (a[j][k] == '1')
{
gx = j;
gy = k;
}
sum += bfs();
for (int i = 0; i < n - 1; i++)
{
for (int j = 0; j < N; j++)
for (int k = 0; k < M; k++)
{
if (a[j][k] == (char)(i+49))
{
sx = j;
sy = k;
}
if (a[j][k] == (char)(i+50))
{
gx = j;
gy = k;
}
}
sum += bfs();
}
cout << sum << endl;
}
}
|
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define DBG(...) \
do { \
cerr << #__VA_ARGS__ << ": "; \
debug(__VA_ARGS__); \
cerr << " (L" << __LINE__ << ")" << endl; \
} while (0)
#else
#define DBG(...)
#endif
void read_from_cin() {}
template <typename T, typename... Ts>
void read_from_cin(T& value, Ts&... args) {
std::cin >> value;
read_from_cin(args...);
}
#define CIN(type, ...) \
type __VA_ARGS__; \
read_from_cin(__VA_ARGS__);
template <typename T>
void write_to_cout(const T& value) {
std::cout << value << std::endl;
}
template <typename T, typename... Ts>
void write_to_cout(const T& value, const Ts&... args) {
std::cout << value << ' ';
write_to_cout(args...);
}
#define COUT(...) write_to_cout(__VA_ARGS__);
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, n) for (auto i : (n))
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using ll = long long;
using namespace std;
int dp_eq[101][5];
int dp_lo[101][5];
int main() {
CIN(string, N);
CIN(int, K);
dp_eq[0][0] = 1;
REP(i, N.size()) {
for (int z = 0; z <= 3; ++z) {
int d = N[i] - '0';
dp_eq[i + 1][z + (d != 0)] += dp_eq[i][z];
dp_lo[i + 1][z + (d != 0)] += dp_lo[i][z];
if (d > 0) dp_lo[i + 1][z] += dp_eq[i][z] + dp_lo[i][z];
if (d > 1) dp_lo[i + 1][z + 1] += (dp_eq[i][z] + dp_lo[i][z]) * (d - 1);
dp_lo[i + 1][z + 1] += dp_lo[i][z] * (9 - d);
}
}
COUT(dp_eq[N.size()][K] + dp_lo[N.size()][K])
}
| 0
| 48,691,272
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <cstdio>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;
ll N, K;
vector<ll> A;
vector<ll> B;
int main()
{
cin >> N >> K;
A.resize(N);
B.resize(N+1);
for(int i = 0;i < N;i++)
{
cin >> A[i];
}
ll logN = log2(N)+100;
for(ll i = 0;i < min(K, logN) ;i++)
{
fill(B.begin(), B.end(), 0LL);
for(ll j = 0; j < N;j++)
{
B[max(j-A[j], 0LL)]++;
if(j+A[j] < N-1)B[j+A[j]+1]--;
}
for(ll j = 0;j < N;j++)
{
A[j] = B[j];
B[j+1] += B[j];
}
}
for(ll i = 0;i < N;i++)
{
cout << B[i];
if(i == N-1)
{
cout << endl;
}
else
{
cout << " ";
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vll vector<ll>
typedef long long int ll;
typedef long double ld;
using namespace std;
int main(int argc, char const *argv[]) {
ll n, a;std::cin >> n;
std::vector<ll> num(300001, 0), S(300001, 0), T(300001, 0);
for(int i=0;i<n;i++){
std::cin >> a;
num[a]++;
}
for(int i=1;i<=n;i++) S[num[i]]++;
std::vector<ll> x(n, 0);
S[0] = T[0] = 0;
for(int i=1;i<=n;i++) {
T[i] = T[i-1] + S[i];
S[i] = S[i-1] + S[i] * i;
}
for(int i=1;i<=n;i++) x[i-1] = (S[i] + i * (T[n]-T[i]))/i;
sort(x.begin(), x.end());
for(int i=1;i<=n;i++){
ll ans = lower_bound(x.begin(), x.end(), i) - x.begin();
std::cout << n - ans << '\n';
}
return 0;
}
| 0
| 38,252,508
|
#include <iostream>
#include <map>
using namespace std;
int main(){
int dx[] = {1,0,-1,0,1,1,-1,-1}, dy[] = {0,1,0,-1,1,-1,1,-1};
int H, W, N;
cin >> H >> W >> N;
int a, b;
map<pair<int,int>, int> M;
for(int i = 0; i < N; ++i){
cin >> a >> b;
if(a > 1 && a < H && b > 1 && b < W){
++M[make_pair(a,b)];
}
for(int j = 0; j < 8; ++j){
int s = a + dx[j], t = b + dy[j];
if(s > 1 && s < H && t > 1 && t < W){
++M[make_pair(s,t)];
}
}
}
long long int ans[10], t = (long long int)(H-2)*(W-2);
fill(ans,ans+10,0LL);
for(map<pair<int,int>, int>::iterator itr = M.begin(); itr != M.end(); ++itr){
++ans[itr->second];
--t;
}
ans[0] = t;
for(int i = 0; i < 10; ++i){
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
int main(){
int n;
cin>>n;
vector<int> a(n);
int m1;
rep(i,n){
cin>>a[i];
m1=max(m1,a[i]);
}
int m2=0;
int cnt=0;
rep(i,n){
if(a[i]==m1)++cnt;
else m2=max(m2,a[i]);
}
rep(i,n){
if(a[i]!=m1){
cout<<m1<<endl;
}else if(cnt>1){
cout<<m1<<endl;
}else{
cout<<m2<<endl;
}
}
}
| 0
| 54,994,603
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
string s;
cin >> s;
int ans1 = 0, ans2 = 0;
rep(i,s.size()){
if(i%2 == 0 && s[i] == '0') ans1++;
else if(i%2 == 1 && s[i] == '1') ans1++;
}
rep(i,s.size()){
if(i%2 == 0 && s[i] == '1') ans2++;
else if(i%2 == 1 && s[i] == '0') ans2++;
}
cout << min(ans1, ans2) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = (int)s.size();
ll ans = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'B') {
cnt++;
} else {
ans += cnt;
}
}
cout << ans << '\n';
return 0;
}
| 0
| 50,054,961
|
#include <bits/stdc++.h>
using i64 = long long;
int main() {
int n;
scanf("%d", &n);
std::vector<int> a(1 << n);
for (auto &e : a) scanf("%d", &e);
std::vector<std::pair<int, int>> dp(1 << n, std::make_pair(-1, -1));
for (int i = 0; i < (1 << n); i++) {
dp[i].first = i;
}
for (int i = 0; i < n; i++) for (int j = 0; j < (1 << n); j++) {
if (j & (1 << i)) {
int k = j ^ (1 << i);
if (a[dp[j].first] < a[dp[k].first]) {
dp[j].second = dp[j].first;
dp[j].first = dp[k].first;
} else if (dp[j].second < 0 || a[dp[j].second] < a[dp[k].first]) {
dp[j].second = dp[k].first;
}
if (dp[k].second >= 0 && a[dp[j].second] < a[dp[k].second]) {
dp[j].second = dp[k].second;
}
}
}
int max = 0;
for (int i = 1; i < (1 << n); i++) {
max = std::max(max, a[dp[i].first] + a[dp[i].second]);
printf("%d\n", max);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i = (n); i >= 1; --i)
typedef long long LL;
typedef pair<int, int> pii;
const int INTINF = int(1e9) + 1;
const LL LLINF = LL(1e18) + 1;
long double eps = 1.0E-14;
#define pow10(n) int(1e##n + n)
void solve()
{
string S;
cin >> S;
int ans = 0;
int l = 0, r = S.length() - 1;
while (r - l >= 1)
{
if (S[r] == S[l])
{
r--;
l++;
}
else if (S[r] == 'x')
{
ans++;
r--;
}
else if (S[l] == 'x')
{
ans++;
l++;
}
else
{
cout << -1 << endl;
return;
}
}
cout << ans << endl;
}
int main(int argc, char const *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(20);
solve();
return 0;
}
| 0
| 46,504,626
|
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010, M = 13;
int n, m;
int a[N];
int p[N];
int find(int x)
{
if (x != p[x]) p[x] = find(p[x]);
return p[x];
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++ ) scanf("%d", a + i);
for (int i = 0; i < N; i ++ ) p[i] = i;
while (m -- )
{
int a, b;
scanf("%d%d", &a, &b);
a = find(a), b = find(b);
p[a] = b;
}
int res = 0;
for (int i = 1; i <= n; i ++ )
{
int pa = find(i), pb = find(a[i]);
if (pa == pb) res ++ ;
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,n,s) for(int i = s; i < (n); ++i)
#define rsrep(i,n,s) for(int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define aall(a) (a), (a)+countof(a)
#define raall(a) (a), (a)+countof(a), greater<>()
#define show(x) cout<<#x<<" = "<<x<<endl;
#define vfind(v, a) find(all(v), a) != v.end()
#define yn(f) { if (f) puts("YES"); else puts("NO"); }
#define yns(f) { if (f) puts("Yes"); else puts("No"); }
#define show_ary(...) { cout<<#__VA_ARGS__<<" = "; for (const auto& x : (__VA_ARGS__)) { cout<<x<<" "; } cout<<endl; }
#define out_ary(...) { for (const auto& x : (__VA_ARGS__)) { cout<<x<<" "; } cout<<endl; }
#define argmax(v) distance((v).begin(), max_element(all(v)))
#define argmin(v) distance((v).begin(), min_element(all(v)))
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
typedef long long int ll;
typedef vector<int> vint;
typedef vector<float> vfloat;
typedef vector<string> vstr;
typedef vector<bool> vbool;
typedef vector<vint> vvint;
typedef vector<vstr> vvstr;
const ll LINF = 2000000000000000000ll;
const int INF = 1000000100;
const ll MOD = 1e9+7;
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < 2*n; i += 2) {
if (s[i] == 'B') s[i] = 'W';
else s[i] = 'B';
}
int w = 0;
ll ans = 1;
rep(i, 2*n) {
if (s[i] == 'W') w++;
else {
if (w == 0) {
puts("0");
return 0;
}
ans *= w;
ans %= MOD;
w--;
}
}
if (w != 0) {
puts("0");
return 0;
}
srep(i, n+1, 1) {
ans *= i;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| 0
| 89,027,491
|
#include <bits/stdc++.h>
#define LL long long
#define FOR(i,a,b) for(LL i=a; i<=b; i++)
#define FOD(i,a,b) for(LL i=a; i>=b; i--)
#define pa pair<int,int>
#define fi first
#define se second
#define MOD xxx
#define getbit(n,i) ((n>>(i-1))&1)
#define offbit(n,i) ((n^(1<<(i-1))
#define onbit(n,i) (n|(1<<(i-1)))
#define cntone(x) (__builtin_popcount(x))
using namespace std;
const int N = 3e5+5;
const LL MOD = 1e9+7;
LL n;
LL A[N];
LL BITO[105],BITZ[105],ans(0),PT[65];
int main()
{
cin >> n;
FOR(i,1,n) cin >> A[i];
PT[0] = 1;
FOR(i,1,59) PT[i] = (PT[i-1]*2)%MOD;
FOR(i,1,n)
{
FOR(j,1,60)
{
LL u = getbit(A[i],j);
LL t;
if(u==0) t = BITO[j];
else t = BITZ[j];
ans = (ans + (t * PT[j-1])%MOD )%MOD;
if(u==1) BITO[j]++;
else BITZ[j]++;
}
}
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
vector<int>graph[1000005];
bool vis[1000005];
int connection[1000005];
bool BPM(int node)
{
int sz=graph[node].size();
for(int i=0; i<sz; i++)
{
int child=graph[node][i];
if(vis[child]==0)
{
vis[child]=1;
if(connection[child]<0 || BPM(connection[child]))
{
connection[child]=node;
return true;
}
}
}
return false;
}
int maxBPM(int n)
{
memset(connection,-1,sizeof(connection));
int res=0;
for(int i=0; i<n; i++)
{
memset(vis,0,sizeof(vis));
if(BPM(i))
res++;
}
return res;
}
int main()
{
FastRead
int n;
cin>>n;
vector<pair<int,int> >R,B;
for(int i=0; i<n; i++)
{
int x,y;
cin>>x>>y;
R.push_back({x,y});
}
for(int i=0; i<n; i++)
{
int x,y;
cin>>x>>y;
B.push_back({x,y});
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)
{
if(R[i].first<B[j].first && R[i].second<B[j].second)
{
graph[i].push_back(j);
}
}
}
cout<<maxBPM(n)<<endl;
return 0;
}
| 0
| 26,288,071
|
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main(){
std::ios::sync_with_stdio(false);
cin.tie(0);
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a+b<c+d)
cout<<"Right"<<endl;
else if(a+b>c+d)
cout<<"Left"<<endl;
else
cout<<"Balanced"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e5 + 5;
int par[maxn], N, sub[maxn];
pair<ll, int> d[maxn];
ll f[maxn];
vector<int> adj[maxn];
int depth[maxn], sz[maxn];
void dfs(int u = 1, int p = -1)
{
sz[u] = 1;
f[1] += depth[u];
for(int v : adj[u]) if(v != p){
depth[v] = depth[u] + 1;
dfs(v, u);
sz[u] += sz[v];
}
}
void reroot(int u = 1, int p = -1)
{
for(int v : adj[u]) if(v != p){
f[v] = f[u] + N - 2 * sz[v];
reroot(v, u);
}
}
bool check(void)
{
for(int i = 1; i <= N; ++i)
if(par[i]) adj[par[i]].pb(i), adj[i].pb(par[i]);
dfs(); reroot();
for(int i = 1; i <= N; ++i){
if(f[d[i].se] != d[i].fi) return false;
}
return true;
}
signed main(void)
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen("A.INP", "r")){
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
}
cin >> N;
for(int i = 1; i <= N; ++i){
cin >> d[i].fi;
d[i].se = i;
sub[i] = 1;
}
sort(d + 1, d + 1 + N);
for(int i = N; i >= 2; --i){
int j = lower_bound(d + 1, d + 1 + N, mp(d[i].fi - (N - 2 * sub[d[i].se]), -1)) - d;
if(i == j) ++j;
if(d[j].fi != d[i].fi - (N - 2 * sub[d[i].se])){
cout << -1;
return 0;
}
par[d[i].se] = d[j].se;
sub[d[j].se] += sub[d[i].se];
}
if(!check()){
cout << -1;
return 0;
}
for(int i = 1; i <= N; ++i){
if(par[i]) cout << i << ' ' << par[i] << '\n';
}
}
| 0
| 60,685,805
|
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
cin >> N;
vector<llong> A(N, 0);
llong ans=0;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<A.size()-1; i++){
for(int j=i+1; j<A.size(); j++){
ans = max(ans, (llong)abs(A[i]-A[j]));
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
int main()
{
int n, k; cin>>n>>k;
vector<ll> a(n, 0);
rep(i, n) cin>>a[i];
ll nin = 1LL<<60;
rep(bits, 1<<(n-1)) {
ll bef = a[0];
ll cost = 0;
int nk = 1;
for (int i=1; i<n; i++) {
if (bits>>(i-1)&1) {
cost += max(0LL, bef+1-a[i]);
bef = max(bef+1, a[i]);
nk++;
} else {
if (bef < a[i]) {
bef = a[i];
nk++;
}
}
}
if (k <= nk) nin = min(nin, cost);
}
cout << nin << endl;
return 0;
}
| 0
| 80,964,153
|
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
int main() {
long long n, k, ret = 0;
std::cin >> n >> k;
std::vector<long long> a(n);
std::multiset<long long, std::greater<>> ms;
std::map<long long, bool> m;
for (auto i = 0ll; i < n; i++) {
std::cin >> a[i];
if (a[i] < k) ms.insert(a[i]);
}
for (auto i = 0ll; i < n; i++) {
if (a[i] >= k) continue;
if (m.find(a[i]) != m.end()) {
ret += (m[a[i]] ? 1 : 0);
continue;
}
m[a[i]] = true;
std::bitset<5000> bs;
ret++;
auto flg = true;
for (auto num : ms) {
if (num == a[i] && flg) {
flg = false;
continue;
}
bs = bs | (bs << num);
bs[num] = 1;
auto brk = false;
for (auto l = k - a[i]; l < k; l++) {
if (bs[l]) {
ret--;
m[a[i]] = false;
brk = true;
break;
}
}
if (brk) break;
}
}
std::cout << ret << std::endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
string s[9]={".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int main(){
int n;
string input;
cin >> n;
for(int i=0; i<n; i++){
char output[76] = "";
cin >> input;
char num = '0';
int kaisu = 0;
int outlength = 0;
for(int j=0; j<(int)input.length(); j++){
if(input[j] != '0'){
num = input[j];
kaisu++;
}else if(input[j] == '0' && kaisu != 0){
output[outlength] = s[atoi(&num)-1][(kaisu-1)%s[atoi(&num)-1].length()];
kaisu = 0;
num = '0';
outlength++;
}
}
output[outlength] = '\0';
cout << output << endl;
}
return 0;
}
| 0
| 43,591,960
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int w, h , n;
cin >> w >> h >> n;
int minX, minY;
minX = minY = 0;
int maxX = w;
int maxY = h;
for (int i=0; i<n; i++) {
int x, y, a;
cin >> x >> y >> a;
if (a == 1) minX = max(minX, x);
if (a == 2) maxX = min(maxX, x);
if (a == 3) minY = max(minY, y);
if (a == 4) maxY = min(maxY, y);
}
cout << max(0,(maxX - minX)) * max(0, (maxY - minY)) << endl;
}
|
#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 ll INF = 1LL<<60;
const ll mod = 1000000007LL;
int main() {
ll N,D,A;
cin>>N>>D>>A;
vector<vector<ll>> v(N,vector<ll>(2));
for(ll i = 0LL; i < N; i++){
ll X,H;
cin>>X>>H;
H=((H-1)/A) + 1;
v[i][0]=X;
v[i][1]=H;
}
sort(v.begin(),v.end());
ll ans = 0LL;
vector<ll> dam(N+1,0LL);
ll d = 0LL;
for(ll i = 0LL; i < N; i++) {
if(i!=0) d=d+dam[i];
if(v[i][1]<=d)continue;
v[i][1]-=d;
vector<ll> s = {v[i][0]+2LL*D,INF};
auto ite = upper_bound(v.begin(),v.end(),s);
ans+=v[i][1];
dam[i]+=v[i][1];
d+=v[i][1];
dam[(int)(ite-v.begin())]-=v[i][1];
}
cout<<ans<<endl;
}
| 0
| 59,428,151
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int n;
string s;
cin >> n >> s;
rep(i, 4){
vector<int> v(n+2);
v[0] = i % 2;
v[1] = i / 2;
rep(index, n){
if(v[index+1]){
if(s[index] == 'o') v[index+2] = v[index];
else v[index+2] = (v[index] + 1) % 2;
}else{
if(s[index] == 'o') v[index+2] = (v[index] + 1) % 2;
else v[index+2] = v[index];
}
}
if(v[0] == v[n] && v[1] == v[n+1]){
REP(index, 1, n+1){
cout << (v[index] ? 'S' : 'W');
}
cout << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
}
|
#include<iostream>
using std::cout;
using std::cin;
using std::endl;
void check(int m, int f, int r) {
int sum = m + f;
if (m == -1 || f == -1) {
cout << 'F' << endl;
} else if (sum >= 80) {
cout << 'A' << endl;
} else if (sum >= 65) {
cout << 'B' << endl;
} else if (sum >= 50) {
cout << 'C' << endl;
} else if (sum >= 30 && r >= 50) {
cout << 'C' << endl;
} else if (sum >= 30) {
cout << 'D' << endl;
} else {
cout << 'F' << endl;
}
}
int main(void) {
int m;
int f;
int r;
cin >> m >> f >> r;
while (m != -1 || f != -1 || r != -1) {
check(m, f, r);
cin >> m >> f >> r;
}
return 0;
}
| 0
| 46,335,750
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<ll, int>> p(n);
rep(i, n) {
cin >> p[i].first;
p[i].second = i;
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
set<ll> bigger;
bigger.insert(-1);
bigger.insert(-2);
bigger.insert(n);
bigger.insert(n+1);
ll ans = 0;
rep(i, n) {
ll q = p[i].first;
int idx = p[i].second;
auto r_idx = *bigger.lower_bound(idx);
auto r_idx2 = *bigger.upper_bound(r_idx);
auto l_idx = *(--bigger.lower_bound(idx));
auto l_idx2 = *(--bigger.lower_bound(l_idx));
if (l_idx != -1) {
ans += (l_idx-l_idx2)*(r_idx-idx)*q;
}
if (r_idx != n ) {
ans += (idx-l_idx)*(r_idx2-r_idx)*q;
}
bigger.insert(idx);
}
cout << ans << endl;
}
|
#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>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI=3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for(int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y) - 1) / (y))
#define MOD 1000000007ULL
#define IN(l, r, x) ((l) <= (x) && (x) < (r))
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
s64 n, k;
cin >> n >> k;
vs64 s(n + 1);
s[0] = 0;
s64 a;
rep (i, n)
{
cin >> a;
s[i + 1] = s[i] + a;
}
vs64 A;
s64 maxA = 0;
rep (l, n)
{
for (int r = l + 1; r <= n; ++r)
{
A.push_back(s[r] - s[l]);
maxA = MAX(maxA, s[r] - s[l]);
}
}
s64 t = 0;
while (((s64)1 << t) <= maxA) ++t;
s64 x = 0;
while (t >= 0)
{
s64 y = (s64)1 << t;
int cnt = 0;
rep (i, A.size())
{
if ((A[i] & (x + y)) == (x + y)) ++cnt;
}
if (cnt >= k) x = x + y;
--t;
}
cout << x << "\n";
return 0;
}
| 0
| 32,818,753
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int L;
cin >> L;
printf("%12f\n",(double)L*L*L/27);
return 0;
}
|
#include<iostream>
#include<cctype>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
char x[1000];
int sum =0;
while(1) {
scanf("%s",x);
if(strlen(x) == 1 && x[0] == '0') break;
for(int i = 0; i < strlen(x);i++){
sum += x[i] - '0';
}
cout << sum << endl;
sum = 0;
}
return 0;
}
| 0
| 77,627,673
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
long long calcGcd(long long a, long long b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
long long calcLcm(long long a, long long b) {
if (a < b) {
int tmp = a;
a = b;
b = tmp;
}
return a / calcGcd(a, b) * b;
}
int main() {
long long a, b, c, d;
cin >> a >> b >> c >> d;
long long all = b - a + 1;
long long divided_c, divided_d, divided_lcm;
divided_c = b / c - (a - 1) / c;
divided_d = b / d - (a - 1) / d;
divided_lcm = b / calcLcm(c, d) - (a - 1) / calcLcm(c, d);
long long ans = all - (divided_c + divided_d - divided_lcm);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
int n;
cin >> n;
vector<pair<int,int>> r(n),b(n);
for(int i=0;i<n;i++){
int a,c;
cin >> a >> c;
r[i] = {a,c};
}
for(int i=0;i<n;i++){
int a,c;
cin >> a >> c;
b[i] = {a,c};
}
sort(r.begin(),r.end());
sort(b.begin(),b.end());
vector<bool> used(n,false);
int count = 0;
for(int i=0;i<n;i++){
int maxy = -1;
int posr = -1;
for(int j=0;j<r.size();j++){
if(r[j].first>=b[i].first) break;
if(r[j].second>=b[i].second) continue;
if(used[j]) continue;
if(maxy<r[j].second){
maxy = r[j].second;
posr = j;
}
}
if(posr==-1) continue;
else{
count++;
used[posr] = true;
}
}
cout << count << endl;
}
| 0
| 9,208,277
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N, K;
cin >> N >> K;
vector<int> d(N);
for (int i = 0; i < N; i++) cin >> d[i];
int ans = -INF;
for (int i = 0; i <= min(K, N); i++) {
for (int j = 0; j <= min(K, N); j++) {
if (i + j > min(N, K)) continue;
vector<int> v;
copy(d.begin(), d.begin() + i, back_inserter(v));
copy(d.rbegin(), d.rbegin() + j, back_inserter(v));
sort(v.begin(), v.end());
int tmp = accumulate(v.begin(), v.end(), 0);
for (int k = 0; k < min((int)v.size(), K - (i+j)); k++) if (v[k] < 0) tmp -= v[k];
ans = max(ans, tmp);
}
}
cout << ans << '\n';
}
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
const ll MOD = 1000000007;
const ll MAX = 2000001;
ll mod(ll a){
return a % MOD;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int root(int x) {
if (r[x] < 0) return x;
return r[x] = root(r[x]);
}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (r[x] > r[y]) swap(x, y);
r[x] += r[y];
r[y] = x;
return true;
}
int size(int x) {
return -r[root(x)];
}
};
int main(){
ll n,m; cin >> n >> m;
UnionFind UF(n);
rep(i,m){
ll a,b; cin >> a >> b; a--; b--;
UF.unite(a,b);
}
ll ans = 0;
rep(i,n){
ans = max(ans,ll(UF.size(i)));
}
cout << ans << endl;
}
| 0
| 51,591,252
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<cmath>
#define REP(i,n) for(int (i) = 0;(i) < (n);(i)++)
using namespace std;
typedef pair<double,double> P;
int n;
void Koch(P p1,P p2,int n1){
P s,t,u;
s.first = (p1.first*2+p2.first)/3;
s.second = (p1.second*2+p2.second)/3;
u.first = (p1.first+2*p2.first)/3;
u.second = (p1.second+2*p2.second)/3;
t.first = (u.first-s.first)*0.5-(u.second-s.second)*0.8660254+s.first;
t.second = (u.first-s.first)*0.8660254+(u.second-s.second)*0.5+s.second;
if(n1 < n){
Koch(p1,s,n1+1);Koch(s,t,n1+1);Koch(t,u,n1+1);Koch(u,p2,n1+1);
}else{
cout << p1.first << " " << p1.second << endl;
cout << s.first << " " << s.second << endl;
cout << t.first << " " << t.second << endl;
cout << u.first << " " << u.second << endl;
}
}
int main(){
cin >> n;
if(n!=0)Koch(P(0,0),P(100,0),1);
else cout << "0 0" << endl;
cout << "100 0" << endl;;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
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 = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
int main() {
int n, d, a;
cin >> n >> d >> a;
vector<pii> mon(n);
int x, h;
for (int i = 0; i < n; ++i) {
cin >> x >> h;
mon[i] = pii(x, (h + a-1) / a);
}
sort(all(mon));
ll res = 0;
ll now = 0;
int j = 0;
vector<ll> v(n, 0);
for (int i = 0; i < n; ++i) {
now += v[i];
if (now >= mon[i].second) continue;
for (;j < n; ++j) {
if (mon[j].first > mon[i].first + 2 * d){
v[j] -= mon[i].second - now;
break;
}
}
res += mon[i].second - now;
now = mon[i].second;
}
cout << res << endl;
}
| 0
| 77,816,868
|
#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 make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
const int INF=1<<29;
const double EPS=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int main(int argc, char const *argv[]) {
int N;
cin >> N;
std::vector<int> array(10001, 0);
for (int i = 0; i < N; ++i) {
int temp;
cin >> temp;
array[temp]++;
}
std::vector<int> ans;
for (int i = 0; i <= 10000; ++i) {
while(array[i]) {
ans.push_back(i);
array[i]--;
}
}
for (int i = 0; i < ans.size(); ++i) {
cout << ans[i];
if (i != ans.size() - 1) {
cout << " ";
}
}
cout << endl;
return 0;
}
|
#include<iostream>
#include<vector>
std::vector<int> vec;
int x;
int n=1;
int main(){
do{
std::cin>>x;
vec.push_back(x);
}while(x!=0);
for(auto l:vec){
if(l!=0)std::cout<<"Case "<<n<<": "<<l<<std::endl;
++n;
}
return 0;
}
| 0
| 88,938,872
|
#include <bits/stdc++.h>
#define long long long
using namespace std;
const int N = 1e3+5;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'L', 'D', 'R', 'U'};
int n, X[N], Y[N];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d %d", X + i, Y + i);
bool chk = (X[1] + Y[1]) & 1;
for(int i = 2; i <= n; i++) if(((X[i] + Y[i]) & 1) != chk) {
printf("-1\n");
return 0;
}
if(!chk) {
printf("32\n");
printf("1 ");
for(int i = 1; i <= n; i++) --X[i];
} else printf("31\n");
for(int i = 0; i <= 30; i++) printf("%d ", 1 << i);
printf("\n");
for(int i = 1; i <= n; i++) {
long x = X[i], y = Y[i];
vector<char> ans;
for(int j = 30; ~j; j--) {
long now = 1ll << j;
for(int k = 0; k < 4; k++) if(abs(x + now * dx[k]) + abs(y + now * dy[k]) <= now - 1) {
x += now * dx[k], y += now * dy[k];
ans.emplace_back(dir[k]);
break;
}
}
if(!chk) ans.emplace_back('R');
reverse(ans.begin(), ans.end());
for(char c : ans) printf("%c", c);
printf("\n");
}
return 0;
}
|
#include <iostream>
using namespace std;
class Dice{
int _num[6];
public:
void set(int num[6]){
for(int i=0;i<6;i++){
_num[i] = num[i];
}
}
void printTop(){
cout << _num[0] << endl;
}
void printRight(){
cout << _num[2] << endl;
}
void N(){
int buf = _num[0];
_num[0] = _num[1];
_num[1] = _num[5];
_num[5] = _num[4];
_num[4] = buf;
}
void S(){
int buf = _num[0];
_num[0] = _num[4];
_num[4] = _num[5];
_num[5] = _num[1];
_num[1] = buf;
}
void W(){
int buf = _num[0];
_num[0] = _num[2];
_num[2] = _num[5];
_num[5] = _num[3];
_num[3] = buf;
}
void E(){
int buf = _num[0];
_num[0] = _num[3];
_num[3] = _num[5];
_num[5] = _num[2];
_num[2] = buf;
}
void SetTop(int n){
if(_num[2]==n)
W();
else if(_num[3]==n)
E();
else{
while(true){
if(_num[0]==n)
break;
S();
}
}
}
void SetFront(int n){
while(true){
if(_num[1]==n)
break;
S();
W();
N();
}
}
};
int main(void){
int num[6];
for(int i=0;i<6;i++){
int n;
cin >> n;
num[i] = n;
}
Dice d;
d.set(num);
int q;
cin >> q;
for(int i=0;i<q;i++){
int t,f;
cin >> t >> f;
d.SetTop(t);
d.SetFront(f);
d.printRight();
}
return 0;
}
| 0
| 22,562,182
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=205;
int n;
int a[MAXN];
int ans;
int main()
{
cin>>n;
for(int i=1;i<=2*n;i++) scanf("%d",&a[i]);
sort(a+1,a+2*n+1);
for(int i=1;i<=2*n;i+=2) ans+=a[i];
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,o,n) for(long long i = o;i<n;i++)
#define oneforall ios::sync_with_stdio(false);cin.tie(0);
#define all(v) (v).begin(),(v).end()
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#define int long long
const long long INF=1e18;
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef vector<pair<long, long > > vpll;
typedef vector<pair<int, int > > vpii;
#define FORR(x,arr) for(auto& x:arr)
bool isprime(int x){
for(int i = 2;i*i<=x;i++){
if(x%i == 0)return false;
}
return x!=1;
}
int gcd(int a, int b)
{
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a-b, b);
return gcd(a, b-a);
}
void solve(){
ini(n);
vi morty;
vi mortysort;
FOR(i,0,n){
ini(x);
morty.push_back(x);
mortysort.push_back(x);
}
sort(all(mortysort));
int tmp = 0;
FOR(i,0,n){
int x1 = lower_bound(all(mortysort),morty[i])-mortysort.begin();
if((x1+i)%2)tmp++;
}
out(tmp/2);
}
int32_t main() {
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
oneforall
solve();
return 0;
}
| 0
| 43,903,369
|
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
int N;
cin >> N;
int ans = 0;
for(int i=1; i<=N; ++i){
int n = to_string(i).length();
if(n%2) ans++;
}
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 1] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
#define print(a) cout << a << endl;
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;} cout << endl;
#define all(v) v.begin(), v.end()
#define sz(v) (int)(v.size())
#define rz(v, n) v.resize((n) + 1);
#define pb push_back
#define fi first
#define se second
#define vi vector <int>
#define pi pair <int, int>
#define vpi vector <pi>
#define vvi vector <vi>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 1;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
readb(n, m);
int x = 1, y = n;
if (n & 1)
{
FOR (i, 1, m) cout << x++ << " " << y-- << endl;
}
else
{
FOR (i, 1, min(m, (n/2)/2)) cout << x++ << " " << y-- << endl;
y--;
FOR (i, (n/2)/2 + 1, m) cout << x++ << " " << y-- << endl;
}
}
| 0
| 93,421,653
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1000000000;
constexpr ll INF = 1000000000000000000;
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i, N) cin >> S[i];
map<string, int> cnt;
ll ans = 0;
rep(i, N) {
sort(ALL(S[i]));
ans += cnt[S[i]];
++cnt[S[i]];
}
cout << ans << "\n";
return 0;
}
|
#include<iostream>
#include<string>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int n;
while(cin>>n,n){
string s;
int ans=0;
bool pre=false,r=false,l=false;
rep(i,n){
cin>>s;
if(s=="lu")l=true;
if(s=="ru")r=true;
if(s=="ld")l=false;
if(s=="rd")r=false;
if(pre==false && r==true && l==true){
ans++;
pre=true;
}
if(pre==true && r==false && l==false){
ans++;
pre=false;
}
}
cout<<ans<<endl;
}
return 0;
}
| 0
| 3,175,985
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int a=0,b=0,c=0;
cin>>a>>b>>c;
int d=a-b;
if(d<c){
cout<<c-d<<endl;
}
else if(d>=c){
cout<<'0'<<endl;
}
}
|
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#include <random>
#include <time.h>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define endl "\n"
#define all(c) begin(c),end(c)
using namespace std;
int in() {int x;scanf("%d",&x);return x;}
ll lin() {ll x;scanf("%lld",&x);return x;}
#define INF 1e9+7
#define LLINF 1e18+7
#define N 500000
ll MOD=1e9+7;
int change(vec v){
int ret=0,bi=1;
rep(i,26){
ret+=v[i]*bi;
bi*=2;
}
return ret;
}
int dp[1<<26+2];
main(){
string ss;cin>>ss;
int n=ss.size();
vec s;
rep(i,n){
s.pb((int)(ss[i]-'a'));
}
vec counter(26);
rep2(i,1,n){
counter[s[i-1]]^=1;
}
int flag=1;
rep(i,26)flag-=counter[i];
if(flag>=0){
cout<<1<<endl;return 0;
}
counter=vec(26);
dp[0]=0;
rep(i,n+1){
int now=change(counter);
if(dp[now]==0&&now)dp[now]=INF;
rep(j,26){
vec temp=counter;
temp[j]^=1;
int place=change(temp);
if(dp[place]==0&&place)dp[place]=INF;
dp[now]=min(dp[now],dp[place]+1);
}
if(i<n)
counter[s[i]]^=1;
else
cout<<dp[now]<<endl;
}
return 0;
}
| 0
| 55,413,045
|
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b,c,d,m,n,maxi=0,f=0,mini=INF,sum=0;
string str;
cin>>n;
vector<ll> v(n);
rep(i,n){
cin>>v[i];
}
deque<ll> ans;
if(n%2){
rep(i,n){
if(i%2) ans.push_back(v[i]);
else ans.push_front(v[i]);
}
}else{
rep(i,n){
if(i%2) ans.push_front(v[i]);
else ans.push_back(v[i]);
}
}
rep(i,n) cout<<ans[i]<<" ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define all(c) (c).begin(), (c).end()
#define sz(x) ((int)(x).size())
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
if (t < u) t = u;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for(int i = 0; i < v.size(); i++) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << H;
debug_out(T...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
const ll MOD = 1e9 + 7;
constexpr ll INF = 1e18;
const int MX = 3010;
V <int> g[100001];
int h[100001];
bool good[100001], vis[100001];
int n, m, u, v;
int main(){
ios::sync_with_stdio(false);
cin >> n >> m ;
for(int i =1; i <= n; i++){
cin >> h[i];
}
for(int i = 0; i < m; i++){
cin >> u >> v;
g[u].eb(v);
g[v].eb(u);
}
function < void (int) > dfs = [&] (int u){
vis[u] = 1;
for(auto v : g[u]){
if(h[u] <= h[v])
good[u] = 1;
if(!vis[v])
dfs(v);
}
return ;
};
for(int i = 1; i <= n; i++)
if(!vis[i])
dfs(i);
int ans = 0;
for(int i = 1; i <= n; i++)
ans += (good[i] ? 0 : 1);
cout << ans << endl;
return 0;
}
| 0
| 75,883,431
|
#include <cstdio>
#include <cmath>
#include <complex>
using namespace std;
#define EPS 10e-8
#define PI 3.1415926535
typedef complex<double> Point;
int n;
Point ps[4];
int main() {
scanf("%d", &n);
while (n--) {
for (int i=0; i<4; i++) {
double x, y;
scanf("%lf%lf", &x, &y);
ps[i] = Point(x, y);
}
double t = abs(arg((ps[3]-ps[2])/(ps[1]-ps[0])));
if ((-EPS < t && t < EPS) || (PI-EPS < t && t < PI+EPS)) {
puts("YES");
} else {
puts("NO");
}
}
}
|
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
int n;
cin>>n;
vector<int>a(n);
int sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
sum+=a[i];
}
if(n==1){
cout<<0<<endl;
return 0;
}
sum=(sum)/n;
int ans1=0,ans2=0,ans3=0;
for(int i=0;i<n;i++){
int temp=abs(a[i]-sum);
ans1+=temp*temp;
}
sum+=1;
for(int i=0;i<n;i++){
int temp=abs(a[i]-sum);
ans2+=temp*temp;
}
sum-=2;
for(int i=0;i<n;i++){
int temp=abs(a[i]-sum);
ans3+=temp*temp;
}
cout<<min({ans1,ans2,ans3})<<endl;
return 0;
}
| 0
| 5,859,539
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#define uni(e) e.erase(unique(e.begin(),e.end()),e.end())
#define double long double
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; }
int INF=1e10;
int MOD=1e9+7;
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
int keta(int a){
double b=a;
b=log10(b);
int c=b;
return c+1;
}
int kurai(int a,int b){
int m=pow(10,b),n=pow(10,b-1);
return (a%m)/n;
}
int ketawa(int a){
int k=0;
rep(i,keta(a)){
k+=kurai(a,i+1);
}
return k;
}
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int lcm(int a,int b){
return a/gcd(a,b)*b;
}
int mid(int a,int b,int c){
vector<int> k(3);
k[0]=a;k[1]=b;k[2]=c;
sort(all(k));
return k[1];
}
bool sosuu(int a){
bool b=1;
if(a<=1)
return 0;
else{
rep1(i,sqrt(a)-1){
if(a%(i+1)==0)
b=0;
}
return b;
}
}
int modpow(int a,int b,int m=MOD){
if(!b)return 1; if(b&1)return modpow(a,b-1,m)*a%m;
int memo = modpow(a,b>>1,m);
return memo*memo%m;
}
int fact_mod(int n) {
int f=1;
for(int i=2;i<n+1;i++) f=f*(i%MOD)% MOD;
return f;
}
int mod_pow(int x,int n) {
int res=1;
while(n>0){
if(n&1) res=(res*x)%MOD;
x=(x*x)%MOD;
n>>=1;
}
return res;
}
int c_mod(int n, int r) {
if(r>n-r) r=n-r;
if(r==0) return 1;
int a=1;
rep(i,r)
a=a*((n-i)%MOD)%MOD;
int b=mod_pow(fact_mod(r), MOD-2);
return (a%MOD)*(b%MOD)%MOD;
}
signed main(){
vector<double> a(5);
rep(i,5)
cin>>a[i];
int b=0;
rep(i,5){
a[i]/=10;
b+=ceil(a[i])*10;
a[i]*=10;
}
int c=INF;
vector<int> d(5);
rep(i,5){
d[i]=a[i];
}
rep(i,5){
if(!(d[i]%10==0))
c=min(c,d[i]%10);
}
if(c==INF){
c=0;
b+=10;
}
b+=c;
b-=10;
out(b);
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll n;cin>>n;
char c[333][333];
rep(i,0,n)rep(j,0,n)cin>>c[i][j];
ll an=0,ok=1;
rep(i,0,n){
ok=1;
rep(j,0,n){
rep(k,0,n){
if(j==k)continue;
if(c[(j+i)%n][k]!=c[(i+k)%n][j])ok=0;
}
}
if(ok)an+=n;
}
cout<<an<<endl;
}
| 0
| 66,312,009
|
#include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
typedef long long int ll;
typedef unsigned long long ull;
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;}
typedef pair<ll,ll> P;
const long long MOD = 1e9+7;
const ll INF = 1LL << 60;
int main(){
bool G[10][10] ={false};
int n,m;
cin >> n >> m;
rep(i, m){
int a,b;
cin >> a >> b; --a, --b;
G[a][b] = G[b][a] = true;
}
vector<int> ord(n);
for(int i = 0; i < n; i++){
ord[i] = i;
}
int res = 0;
do{
if(ord[0] != 0)break;
bool ok = true;
for(int i = 0; i < n - 1; i++){
int from = ord[i];
int to = ord[i+1];
if(!G[from][to]){
ok = false;
}
}
if(ok)res++;
}while(next_permutation(all(ord)));
cout << res << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Edge=pair<ll,ll>;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
template<class T>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;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll power(ll a,ll b){
ll res=1;
while(b>0){
if(b&1) res=res*a%MOD;
a=a*a%MOD;
b>>=1;
}
return res;
}
int main(){
ll N,K,ans=0;
cin>>N>>K;
ll CNT[K+1];
RREP(i,K) CNT[i]=0;
for(ll i=K; i>0; --i){
ll cnt=0;
cnt+=power(K/i,N);
for(ll j=2; j<=K/i; ++j){
cnt-=CNT[j*i];
}
cnt%=MOD;
if(cnt<0) cnt+=MOD;
CNT[i]=cnt;
ans+=i*CNT[i];
ans%=MOD;
}
co(ans);
return 0;
}
| 0
| 71,833,596
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long , long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x,d) cout<<fixed<<setprecision(d)<<x
#define fill(a,b) memset((a),(b),sizeof((a)))
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);srand(time(NULL));
ll power(ll x,ll y,ll m){ll r=1;for(;y;y>>=1){if(y&1)r=r*x%m;x=x*x%m;}return r;}
const ll mod = 1e9 + 7;
const ld pi = 3.14159265358979;
int run_test(){
int n, m;
cin >> n >> m;
vector<int> v[n + 1];
for(int i=0; i<m; i++){
int a, b;
cin >> a >> b;
v[a].pb(b);
v[b].pb(a);
}
int ans[n + 1];
queue<int> q;
q.push(1);
int visited[n + 1];
fill(visited, 0);
visited[1] = 1;
while(!q.empty()){
int k = q.front();
q.pop();
for(auto to: v[k]){
if(!visited[to]){
visited[to] = 1;
q.push(to); ans[to] = k;
}
}
}
cout << "Yes\n";
for(int i=2; i<n + 1; i++){
cout << ans[i] << "\n";
}
return 0;
}
int main(){
FAST;
ll t;
t = 1;
while(t--){
run_test();
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF ((int)(1e17))
#define EPS 1e6
signed main(){
cout<<fixed<<setprecision(6);
int N;
int sum = 0;
vector<int> t, v, maxs, maxs2;
int V = 0, bV = 0;
double ans = 0;
cin>>N;
t.resize(N+10,0);
v.resize(N+10,0);
maxs.resize(N*210,0);
maxs2.resize(N*210,0);
for(int i = 0; i < N; i++){
cin>>t[i];
}
for(int i = 0; i < N; i++){
cin>>v[i];
for(int j = 0; j < t[i]; j++){
maxs[sum+j] = v[i];
}
for(int j = 1; j <= t[i]; j++){
maxs2[sum+j] = v[i];
}
sum += t[i];
}
for(int i = sum+1; i >= 1; i--){
maxs[i-1] = min(maxs[i-1], maxs[i]+1);
}
for(int i = 0, j = 0; i <= sum; i++){
if(maxs[i] == maxs[i+1]){
if(V < maxs[i]){
ans += V+0.5;
V++;
} else if(V == maxs[i]){
ans += V;
}
} else if(maxs[i] < maxs[i+1]){
if(maxs2[i+1] >= V+1){
ans += V + 0.5;
V++;
} else {
ans += V;
}
} else if(maxs[i] > maxs[i+1]){
if(V == maxs[i+1]){
ans += V + 0.25;
} else if(V == maxs[i]){
ans += V - 0.5;
V--;
} else if(maxs[i+1] >= V+1){
ans += V+ 0.5;
V++;
}
}
}
cout<<ans<<endl;
}
| 0
| 12,881,235
|
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
char c;
cin >> c;
switch (c) {
case 'a':
case 'i':
case 'u':
case 'e':
case 'o':
cout << "vowel" << endl;
break;
default:
cout << "consonant" << endl;
break;
}
return 0;
}
|
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
long long power(long long a, long long b,long long m) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a %m;
a = a * a %m;
b >>= 1;
}
return res;
}
const int mod=998244353;
int dp[3005][3005];
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
int n;
cin>>n;
int a[n+2];
int tot=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
tot+=a[i];
}
int z=n*(n+1)/2;
if(tot%z)
cout<<"NO";
else
{
z=tot/z;
int temp=z;
int diff;
a[n+1]=a[1];
for(int i=2;i<=n+1;i++)
{
diff=a[i-1]-a[i]+z;
if(diff<0)
{
cout<<"NO";
return 0;
}
if(diff%n)
{
cout<<"NO";
return 0;
}
temp-=diff/n;
}
if(temp)
cout<<"NO";
else
{
cout<<"YES";
}
}
}
| 0
| 83,928,578
|
#include <cstdio>
#include <algorithm>
using namespace std;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define rep(i,x) for(int i=0;i<(x);++i)
const int inf = 1e9;
int d[10][10];
bool found[10];
int N;
void wf()
{
rep(k, 10) rep(i, 10) rep(j, 10) {
chmin(d[i][j], d[i][k] + d[j][k]);
}
}
int main()
{
while (scanf("%d", &N), N) {
fill_n(found, 10, false);
fill(d[0], d[10], inf);
rep(i, 10) d[i][i] = 0;
rep(i, N) {
int a, b, c; scanf("%d %d %d", &a, &b, &c);
d[a][b] = d[b][a] = c;
found[a] = found[b] = true;
}
wf();
int mi = inf, a;
rep(i, 10) if (found[i]) {
int sum = 0;
rep(j, 10) if (found[j]) {
sum += d[i][j];
}
if (mi > sum) {
mi = sum;
a = i;
}
}
printf("%d %d\n", a, mi);
}
}
|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<map>
#include<numeric>
#include<queue>
#include<string>
#include<sstream>
using namespace std;
int main(void) {
string left = "qwertasdfgzxcvb";
string s;
while(cin >> s){
if( s[0] == '#' ) break;
vector<bool> b(s.size(), false);
for(int i=0; i<s.size(); i++){
for(int j=0; j<left.size(); j++){
if( s[i] == left[j] ){
b[i] = true;
break;
}
}
}
int cnt = 0;
bool f = b[0];
for(int i=0; i<b.size(); i++){
if( f != b[i] ){
f = !f;
cnt++;
}
}
cout << cnt << endl;
}
return 0;
}
| 0
| 93,694,384
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
using ll = long long;
typedef pair<int, int> P;
int main(){
int n;
cin>>n;
vector<int> dat(n+1);
rep(i,n){
cin>>dat[i];
}
sort(dat.begin(),dat.end());
reverse(dat.begin(),dat.end());
ll first=0,second=0;
rep(i,n){
if(dat[i]==dat[i+1]){
if(first==0){
first=dat[i];
i++;
}
else{
second=dat[i];
break;
}
}
}
cout<<first*second<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <math.h>
#include <stack>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repr(i, n) for(int i = n - 1; i >= 0; i--)
using namespace std;
using ll = long long int;
using p = pair<int, int>;
using pl = pair<ll, ll>;
using v = vector<int>;
using vd = vector<double>;
using vs = vector<string>;
using vl = vector<ll>;
int main()
{
int n, m;
cin >> n >> m;
vector<pair<int, int>> t(m, {0, 0});
if(n % 2 != 0) {
int l = 1;
int r = n - 1;
for(int i = 0; i < m; i++)
{
t[i] = {l, r};
l++;
r--;
}
}else{
bool flag = false;
int l = 1;
int r = n;
for(int i = 0; i < m; i++)
{
if(!flag && r - l <= n / 2) {
r--;
flag = true;
}
t[i] = {l, r};
l++;
r--;
}
}
for(auto e : t) {
cout << e.first << " " << e.second << endl;
}
}
| 0
| 70,118,143
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
int main(void){
cin.tie(0);
ios::sync_with_stdio(0);
int n,m,k;
cin>>n>>m>>k;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;j++){
if((n-i)*j+i*(m-j)==k){
cout<<"Yes"<<endl;
return 0;
}
}
}
cout<<"No"<<endl;
}
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
vector<pair<int,int> > vpii(80);
string num;
void print(int s,int f){
switch(f-48){
case 1:switch(s%5){
case 1:cout<<'.';break; case 2:cout<<',';break; case 3:cout<<'!';break;case 4:cout<<'?';break; case 0:cout<<" ";break;}break;
case 2:switch(s%3){
case 1:cout<<'a';break; case 2:cout<<'b';break; case 0:cout<<'c';break;}break;
case 3:switch(s%3){
case 1:cout<<'d';break;case 2:cout<<'e';break;case 0:cout<<'f';break;}break;
case 4:switch(s%3){
case 1:cout<<'g';break;case 2:cout<<'h';break;case 0:cout<<'i';break;} break;
case 5:switch(s%3){
case 1:cout<<'j';break;case 2:cout<<'k';break;case 0:cout<<'l';break;} break;
case 6:switch(s%3){
case 1:cout<<'m';break;case 2:cout<<'n';break;case 0:cout<<'o';break;} break;
case 7:switch(s%4){
case 1:cout<<'p';break;case 2:cout<<'q';break;case 3:cout<<'r';break;case 0:cout<<'s';break;} break;
case 8:switch(s%3){
case 1:cout<<'t';break;case 2:cout<<'u';break;case 0:cout<<'v';break;}break;
case 9:switch(s%4){
case 1:cout<<'w';break;case 2:cout<<'x';break;case 3:cout<<'y';break;case 0:cout<<'z';break;}break;
default :break;
}
}
int main(){
int k=0,l=0,n;
cin >> n;
for(int q=0;q<n;q++){
l=0;
cin >> num;
int a;
for(int i=0;i<num.size();i++){
if(i==0)
a=num[0];
k++;
if(i!=0&&num[i]=='0' &&num[i-1]=='0'){
k=0;
continue;
}else {
if(num[i]!='0')
a=num[i];
if(num[i]=='0'){
vpii[l]=make_pair(a,k-1);
l++;
k=0;
}}
}
for(int j=0;j<l;j++){
int w=0;
print(vpii[j].second,vpii[j].first);
}
cout<<endl;
}
return 0;
}
| 0
| 51,296,654
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int A;
cin >> N >> A;
if (N % 500 == 0){
cout << "Yes" << endl;
}else if (N % 500 != 0 && A > N % 500){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
ll sum = 0;
ll m = 1e10;
bool flag = true;
for(int i = 0; i < n; i++)
{
ll a, b;
cin >> a >> b;
sum += a;
if(a > b)
{
flag = false;
m = min(m, b);
}
}
if(flag) cout << 0 << endl;
else cout << sum - m << endl;
}
| 0
| 61,630,954
|
#include <iostream>
using namespace std;
#include<vector>
int main()
{
int n,k;
cin>>n>>k;
const int INF=1e9+7;
vector<long long int>h(n);
for(int i=0;i<n;i++){
cin>>h[i];}
vector<long long int> s(n,INF);
s[0]=0;
for(long long int i=0;i<n;i++)
{
for(long long int j=i+1;j<=i+k;j++)
{
if(j<n)
s[j]=min(s[j],s[i]+abs(h[j]-h[i]));
}
}
cout<<s[n-1];
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int n;
double x[4], y[4], a, b;
cin >> n;
while(n--){
for(int i = 0; i < 4; i++){
cin >> x[i] >> y[i];
}
if(x[0]-x[1] == 0){
if(x[2]-x[3] == 0){
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} else {
a = (y[0]-y[1])/(x[0]-x[1]);
b = (y[2]-y[3])/(x[2]-x[3]);
if(a == b){
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
}
return 0;
}
| 0
| 1,966,452
|
#include<stdio.h>
#include<string.h>
int main(){
char m[1000],b[2],g[1000][1000],c[2]="-";
int n,a,i,j,d,f=0;
while(1){
scanf("%s",m);
if(strcmp(m,c)==0){
break;
}
int e=strlen(m);
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a);
for(j=0;j<a;j++){
b[0]=m[0];
d=1;
while(d!=e){
m[d-1]=m[d];
d++;
}
m[e-1]=b[0];
}
}
strcpy(g[f],m);
f++;
}
for(i=0;i<f;i++){
printf("%s\n",g[i]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000*100+1
#define numberOfSetBits(S) __builtin_popcount(S)
#define MSET(x,y) memset(x,y,sizeof(x))
#define gcd(a,b) __gcd(a,b)
#define all(x) x.begin(),x.end()
#define isOn(S, j) (S & (1 << j))
#define endl '\n'
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define print(x) for(auto it:x) cout<<it<<' '; cout<<endl;
#define printii(x) for(auto it:x) cout<<it.F<<' '<<it.S<<'\t'; cout<<endl;
#define in(x,n) for(int e=0;e<n;e++){ll y;cin>>y;x.pb(y);}
#define vi vector<ll>
#define vvi vector<vi>
#define ii pair<ll,ll>
#define pll pair<ll,ll>
#define vii vector<ii>
#define vvii vector<vii>
#define viii vector<pair<ii,ll>>
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define mc(a,b,c) mp(mp(a,b),c)
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cout << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cout << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
vi cost = {1234556741223ll, 2 , 5 , 5 , 4 , 5 , 6 , 3 , 7 , 6};
int dp[10004][10004];
set<ll,greater<ll>> s;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,x,t,m,y,z;
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>x;
s.insert(x);
}
x = 7;
for(auto it: s){
x = min(x, cost[it]);
}
ll len = n/x;
MSET(dp,-1);
dp[len][0] = 0;
for(int i=len-1;i>=0;i--){
for(int j=0;j<=n;j++){
for(auto k:s){
if((j-cost[k])>=0){
if(dp[i+1][j-cost[k]]!=-1){
dp[i][j] = k;
break;
}
}
}
}
}
ll cos = n;
for(int i=0;i<len;i++){
if(dp[i][cos]!=-1){
cout<<dp[i][cos];
cos-=cost[dp[i][cos]];
}
}
return 0;
}
| 0
| 69,904,476
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x,n,t,ans;
cin >> n >> x >> t;
ans = (n+x-1)/x;
cout << ans *t << endl;
}
|
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
const ll INF = 1LL << 50;
const ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vll as(n);
rep(i, n) cin >> as[i];
vll dp(n, INF);
dp[0] = as[0];
rep(i, n) {
ll idx = Lower_bound(dp, as[i]);
dp[idx] = as[i];
}
printf("%ld\n", Lower_bound(dp, INF));
return 0;
}
| 0
| 9,104,364
|
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#define L 1
#define A 0
using namespace std;
int main(void)
{
int n;
string s,a;
int i1;
int max;
int count;
while(1){
vector<int> v;
cin >> n;
if (n == 0) break;
vector< pair<string,int> > t;
for(i1=0;i1<n;i1++){
cin >> s;
cin >> a;
t.push_back(make_pair(s,L));
t.push_back(make_pair(a,A));
}
sort(t.begin(),t.end());
v.push_back(t[0].second);
max=v.size();
vector<int>::iterator it;
for(i1=1;i1<2*n;i1++){
if(t[i1].second == L) {
v.push_back(L);
}
else {
v.pop_back();
}
if(max < v.size()) max = v.size();
}
cout << max << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int d;
cin >> d;
string ans = "Christmas";
if(d < 25)
ans += " Eve";
if (d < 24)
ans += " Eve";
if (d < 23)
ans += " Eve";
cout << ans << endl;
}
| 0
| 94,401,217
|
#include <iostream>
#include <vector>
#include <limits>
using namespace std;
int maximum_sub_sequense(vector<int> &s)
{
int max = numeric_limits<int>::min();
for (auto i = s.begin(); i != s.end(); i++) {
int sum = 0;
for (auto j = i; j != s.end(); j++) {
sum += *j;
if (sum > max)
max = sum;
}
}
return max;
}
int main()
{
for (int n; cin >> n && n;) {
vector<int> sequence(n);
for (int x, i = 0; i < n && cin >> x; i++)
sequence[i] = x;
cout << maximum_sub_sequense(sequence) << endl;
}
return 0;
}
|
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 1; i <= 1000; ++i) {
if ((a * i - c) % b == 0) {
cout << "YES" << endl;
return 0;
}
}
cout << "NO" << endl;
return 0;
}
| 0
| 15,447,646
|
#include<iostream>
using namespace std;
long long fac(long long x) {
if (x == 0ll)
{
return 1ll;
}
else
{
return x*fac(x - 1ll);
}
}
int main()
{
long long n;
cin >> n;
cout << fac(n) << endl;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vector<vector<long long int> >;
void PrintTable(const vector<vector<Int> >& table) {
for (Int i = 0; i < (Int)table.size(); ++i) {
for (Int j = 0; j < (Int)table[0].size(); ++j) {
cout << table[i][j] << " ";
}
cout << endl;
}
return;
}
namespace Bits {
static Int LeftBitShift(Int x, Int i);
static Int RightBitShift(Int x, Int i);
static bool IsFlagUp(Int x, Int i);
static bool IsFlagDown(Int x, Int i);
Int LeftBitShift(Int x, Int i) {
return (x << i);
}
Int RightBitShift(Int x, Int i) {
return (x >> i);
}
bool IsFlagUp(Int x, Int i) {
return ((x & (1 << i)) != 0);
}
bool IsFlagDown(Int x, Int i) {
return ((x & (1 << i)) == 0);
}
}
using namespace Bits;
int main(void) {
Int n, m;
cin >> n >> m;
VVI table(m, VI(n, 0));
for (Int i = 0; i < m; ++i) {
Int k;
cin >> k;
for (Int j = 0; j < k; ++j) {
Int s;
cin >> s;
--s;
table[i][s] = 1;
}
}
VI lightOn(m);
for (Int i = 0; i < m; ++i) {
cin >> lightOn[i];
}
Int loop = pow(2, n);
Int result = 0;
for (Int i = 0; i < loop; ++i) {
bool lightFlag = true;
for (Int j = 0; j < m; ++j) {
Int count = 0;
for (Int k = 0; k < n; ++k) {
if (table[j][k] == 1 && IsFlagUp(i, k)) {
++count;
}
}
if ((count % 2) == lightOn[j]) {
} else {
lightFlag = false;
}
}
if (lightFlag) {
result++;
}
}
cout << result << endl;
return 0;
}
| 0
| 5,364,008
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
int n,m;
int a[100010];
int main(){
cin >> n;
repp(i,0,n){
cin >> a[i];
m = max(m,a[i]);
}
int p = -1;
repp(i,0,n) if(a[i] != m && abs(m-2*a[i]) < abs(m-2*p)) p = a[i];
cout << m << ' ' << p << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#define N 10000
using namespace std;
struct s{
int d;
int p;
int dcnt;
};
int main(){
int n,m,i,j,flag,kitaiti;
struct s data[N];
while(1){
flag=0;
kitaiti=0;
cin >> n >> m;
if(n==0&&m==0) break;
for(i=0;i<n;i++){
cin >> data[i].d >> data[i].p;
data[i].dcnt=data[i].d;
}
for(i=0;i<n;i++){
for(j=1;j<n;j++){
if(data[j].p>data[j-1].p) swap(data[j],data[j-1]);
}
}
for(i=0;i<n;i++){
if(flag==0){
if(m>=data[i].dcnt) m-=data[i].dcnt;
else{
flag=1;
kitaiti=(data[i].dcnt-m)*data[i].p;
}
}
else{
kitaiti=kitaiti+data[i].dcnt*data[i].p;
}
}
cout << kitaiti << endl;
}
return 0;
}
| 0
| 2,564,989
|
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef vector<ll> vll;
#define INF 0x3f3f3f3f
#define MOD 998244353LL
#define EPS 0.00001
#define f first
#define s second
#define pb push_back
#define FOR(i, a, b) for (int i=(a); i<=(signed)(b); i++)
#define F0R(i, a) for (int i=0; i<(signed)(a); i++)
#define RFOR(i, a, b) for (int i=(a); i >= b; i--)
#define MN 200005
int n;
ll a[MN];
ll ps[MN];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
F0R(i, n+1) cin >> a[i];
RFOR(i, n, 0) ps[i] = ps[i+1]+a[i];
ll sm = 0;
ll amt = 1;
F0R(i, n+1){
sm += amt;
amt -= a[i];
amt *= 2;
amt = min(amt, ps[i+1]);
if(amt < 0){
cout << "-1\n";
return 0;
}
}
cout << sm << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)
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 (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}init_;
#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << "\n" << flush; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif
const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
ll dp[85];
int main() {
ll N;
cin >> N;
vl A(N);
rep(i, N) cin >> A[i];
dp[0] = 1000;
rep(i, N){
dp[i + 1] = dp[i];
rep(j, i){
chmax(dp[i + 1], dp[j] / A[j] * A[i] + dp[j] % A[j]);
}
}
cout << dp[N] << endl;
}
| 0
| 95,651,346
|
#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(auto i=(x).begin(),i##_fin=(x).end();i!=i##_fin;i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
string solve(bool a) { return ((a) ? "Yes" : "No"); }
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<int , int> Pi;
typedef vector<Pi> VPi;
typedef vector<long long> V;
typedef vector<V> VV;
typedef pair<long long , long long> P;
typedef vector<P> VP;
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;}
template <class T, class U>ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T>ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep(i, v.size()) {
if (i) os << ",";
os << v[i];
}
os << "}";
return os;
}
template <class T, class U>istream& operator>>(istream& is, pair<T, U>& p) {
is >> p.first >>p.second ;
return is;
}
template <class T>istream& operator>>(istream& is, vector<T>& v) {
rep(i, v.size()) {
is >> v[i];
}
return is;
}
const long long INFLL = 1LL<<60;
const int INF = 1<<30;
const double PI=acos(-1);
int main(){
int h,n;
int ans=0;
cin >>h>>n;
VPi data(n);
cin >> data;
VVi dp(n+1, Vi(h + 3, INF));
dp[0][0] = 0;
for (int i = 0; i < n;i++){
for (int j = 0; j < h + 1;j++){
chmin(dp[i+1][j],dp[i][j]);
chmin(dp[i + 1][min(j + data[i].F, h)], dp[i+1][j] + data[i].S);
} }
cout << dp[n][h] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
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;
}
ll gcd(ll n, ll m)
{
ll tmp;
while (m != 0)
{
tmp = n % m;
n = m;
m = tmp;
}
return n;
}
ll lcm(ll n, ll m)
{
return abs(n) / gcd(n, m) * abs(m);
}
using namespace std;
vector<ll>used,sum;
void solve(){
ll n,k;
cin>>n>>k;
vector<ll>p(n+5),c(n+5);
rep(i,n)cin>>p[i+1];
rep(i,n)cin>>c[i+1];
ll ans=-INF;
int cur;
for(int ccur=1;ccur<=n;++ccur){
cur=ccur;
bool ok=false;
used=vector<ll>(n+5);
sum=vector<ll>(n+5);
ll start,loop;
for(ll i=1;i<=k;++i){
cur=p[cur];
sum[i]=sum[i-1]+c[cur];
chmax(ans,sum[i]);
if(i==k){
ok=true;
break;
}
if(used[cur]>0){
loop=i-used[cur];
start=used[cur];
break;
}
used[cur]=i;
}
if(ok)continue;
for(int finish=1;finish<=n;++finish){
ll res=0;
if(used[finish]<start)continue;
if(sum[start+loop]-sum[start]>0){
ll len=(k-used[finish])/loop;
res+=len*(sum[start+loop]-sum[start]);
}
res+=sum[used[finish]];
chmax(ans,res);
}
}
cout<<ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
}
| 0
| 50,822,258
|
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <cassert>
#include <functional>
#include <set>
#include <deque>
#include <list>
using namespace std;
typedef long long ll;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
#define LNF __LONG_LONG_MAX__
const ll MOD = 1000000007;
const int MAX = 200000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long gcd(long long x, long long y){
if(y==0) return x;
else return gcd(y,x%y);
}
long long lcm(long long x, long long y){
return x / gcd(x, y) * y;
}
long long com[200005];
void combination(long long n,long long k){
com[0] = 1;
for(int i=1;i<=k;i++){
com[i] = (com[i-1]*(n-i+1)%MOD)*modinv(i,MOD)%MOD;
}
}
int main(){
int A,B,C,D; cin >> A >> B >> C >> D;
int out=0;
for(int i=min(A,C);i<=max(B,D);i++){
if(A<=i && i<=B && C<=i && i<=D){
out++;
cerr << i << endl;
}
}
cout << max(0,out-1) << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
int H, W, D;
cin >> H >> W >> D;
vector<pair<int, int>> c(H * W);
for (auto i = 0; i < H; ++i)
{
for (auto j = 0; j < W; ++j)
{
int A;
cin >> A;
--A;
c[A] = { i, j };
}
}
vector<ll> sum(H * W);
for (auto i = D; i < H * W; ++i)
{
sum[i] = sum[i - D];
auto& current = c[i];
auto& prev = c[i - D];
auto diffY = prev.first - current.first;
auto diffX = prev.second - current.second;
sum[i] += abs(diffX) + abs(diffY);
}
vector<ll> ans;
int Q;
cin >> Q;
for (auto i = 0; i < Q; ++i)
{
int L, R;
cin >> L >> R;
--L;
--R;
ans.push_back(sum[R] - sum[L]);
}
for (auto i = 0; i < Q; ++i)
{
cout << ans[i] << endl;
}
return 0;
}
| 0
| 14,151,949
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n;
string s;
cin >> n >> s;
int ans = 1;
for (int i = 1; i < n; i++)
{
if (s[i] != s[i - 1])
{
ans++;
}
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool chmax(T &a, const T &b) {
if(a >= b) return false;
a = b;
return true;
}
template <typename T> constexpr bool chmin(T &a, const T &b) {
if(a <= b) return false;
a = b;
return true;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N;
cin >> N;
vector<ll> X(N), Y(N);
bool odd = false, even = false;
rep(i, N) {
cin >> X[i] >> Y[i];
(X[i] + Y[i] & 1 ? odd : even) = true;
if(even) Y[i]--;
}
if(odd && even) {
cout << -1 << endl;
return 0;
}
cout << 31 + even << endl;
for(int i = 30; i >= 0; i--)
cout << (1 << i) << " ";
if(even) cout << 1;
cout << endl;
string s = "LDUR";
rep(i, N) {
ll a = X[i] + Y[i];
ll b = X[i] - Y[i];
ll nowa = 0, nowb = 0;
for(int j = 30; j >= 0; j--) {
int A, B;
nowa += ((A = (nowa < a)) ? 1 : -1) << j;
nowb += ((B = (nowb < b)) ? 1 : -1) << j;
cout << s[2 * A + B];
}
if(even) cout << "U";
cout << endl;
}
return 0;
}
| 0
| 88,201,196
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define emplace_back push_back
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const ll seed = 12289;
const double eps = 1e-6;
const ll inf = 0x3f3f3f3f;
const int N = 2e3 + 10;
ll dp[N][N], sum[N];
int main()
{
int n;
scanf("%d", &n);
for (int i = 3; i <= n; i++) {
dp[i][i] = sum[i] = 1;
}
for (int i = 6; i <= n; i++) {
for (int j = 3; j <= i - 3; j++) {
dp[i][j] += sum[i - j];
sum[i] += dp[i][j];
dp[i][j] %= mod;
sum[i] %= mod;
}
}
printf("%lld\n", sum[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
vector<ll> res;
const long long MAX_V = 3234566667;
void dfs(ll num) {
if (num > MAX_V) return ;
res.push_back(num);
int be = num % 10;
int a1 = be - 1, a2 = be + 1;
if (a1 >= 0) dfs(num * 10 + a1);
if (a2 <= 9) dfs(num * 10 + a2);
dfs(num * 10 + be);
return ;
}
int main()
{
int K;
cin >> K;
repd(i, 1, 10) {
dfs(i);
}
sort(all(res));
cout << res[K - 1] << endl;
return 0;
}
| 0
| 51,736,897
|
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
ll N, X;
cin >> N >> X;
vector<ll> x(N);
set<ll> res;
for (int i = 0; i < N; i++) {
cin >> x[i];
res.insert(abs(X - x[i]));
}
int cnt = 0;
ll ans;
for (auto e : res) {
if (cnt == 0) {
cnt++;
ans = e;
continue;
}
ans = gcd(ans, e);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll N, K;
cin >> N >> K;
ll count = 0;
REP(i, N){
ll a;
cin >> a;
count++;
if(a == 1){
break;
}
}
ll ans = 0;
while(ans*K - (ans-1) < N){
ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 39,839,256
|
#include <cstdio>
#include <utility>
#include <typeinfo>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <tuple>
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long int ll;
using namespace std;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
int main()
{
int h,w;
cin >> h >> w;
int a = -1;
for(int i=0;i<900;i++)
{
a++;
string s;
cin >> s;
if(s == "snuke")
{
break;
}
}
char tate = 'A' + a%w;
int yoko = a/w;
cout << tate << yoko + 1 << endl;
return 0 ;
}
|
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
int main(){
ll W, H;
cin >> W >> H;
ll x, y;
cin >> x >> y;
if(W%2 == 0 && W/2 == x && H%2 == 0 && H/2 == y){
cout << W*H/2 << ".000000000" << " " << "1" << endl;
return 0;
}
if(W%2 == 1 && H%2 == 1){
cout << W*H/2 << ".500000000" << " " << "0" << endl;
}else{
cout << W*H/2 << ".000000000" << " " << "0" << endl;
}
}
| 0
| 5,362,417
|
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
const long long MOD = 1e9 + 7;
typedef pair<int, int> P;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<ll> cnt1(100);
int maxbit = 0;
rep(i, N) {
ll tmp = A[i];
int cnt = 0;
while (tmp > 0) {
if (tmp & 1) cnt1[cnt]++;
cnt++;
tmp >>= 1;
}
chmax(maxbit, cnt);
}
ll ans = 0;
ll ct = 1;
rep(i, maxbit) {
ll t = cnt1[i] * (N - cnt1[i]);
t %= MOD;
ans += (t * ct) % MOD;
ans %= MOD;
ct *= 2;
ct %= MOD;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF= 1LL << 60;
#define REP(i,n) for(ll i=0; i<n; i++)
#define FOR(i,a,n) for(ll i=a; i<n; i++)
struct c{
int num,sum;
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n);
vector<int> B(n);
vector<c> C(n);
REP(i,n){
cin >> A[i] >> B[i];
C[i].num= i;
C[i].sum= A[i]+B[i];
}
sort(C.begin(), C.end(), [](const c &a, const c &b) { return a.sum > b.sum; });
ll s= 0;
REP(i,n){
s+= (i&1)?-B[C[i].num]:A[C[i].num];
}
cout << s << endl;
}
| 0
| 5,277,922
|
#include "bits/stdc++.h"
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rep(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
string s;
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
cin>>s;
ll aa = -1,bb = -1;
rep(i,s.size()){
if(i-1>=0){
if(s[i]==s[i-1]){
aa = i;
bb = i+1;
break;
}
}
if(i-2>=0){
if(s[i-2]==s[i]){
aa = i-1;
bb = i+1;
break;
}
}
}
cout<<aa<<" "<<bb<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int n;
cin >> n;
set<int> dou;
vector<int> can;
int a;
rep(i, n)
{
cin >> a;
if (dou.find(a) != dou.end())
{
can.push_back(a);
dou.erase(dou.find(a));
}
else
{
dou.insert(a);
}
}
if (can.size() < 2)
{
cout << 0 << endl;
}
else
{
sort(can.begin(), can.end());
cout << (long long)(can[can.size() - 1]) * can[can.size() - 2] << endl;
}
return 0;
}
| 0
| 54,413,017
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define repi(n) for (long long i = 0; i < (n); ++i)
#define repj(n) for (long long j = 0; j < (n); ++j)
#define repk(n) for (long long k = 0; k < (n); ++k)
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(itr) for (auto&& v : (itr))
#define updatemax(t, v) (t = std::max(t, (v)))
#define updatemin(t, v) (t = std::min(t, (v)))
int main() {
int n, r;
cin >> n >> r;
cout << (n >= 10 ? r : r + 100 * (10 - n)) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
struct Edge {
const int from, to;
Edge(int from, int to) : from(from), to(to) {}
};
vector<vector<Edge>> ReadUndirectedGraph(
int n, int m, bool is_one_indexed=false) {
vector<vector<Edge>> graph(n);
for (int i = 0; i < m; i++) {
int v1, v2;
cin >> v1 >> v2;
if (is_one_indexed) {
v1--;
v2--;
}
graph[v1].push_back(Edge(v1, v2));
graph[v2].push_back(Edge(v2, v1));
}
return graph;
}
bool Solve() {
int n;
cin >> n;
auto graph = ReadUndirectedGraph(n, n - 1, true);
if (n % 2 == 1) {
return true;
}
if (n == 2) {
return false;
}
vector<int> degrees(n);
for (int v = 0; v < n; v++) {
degrees[v] = graph[v].size();
}
vector<int> removed(n);
queue<int> q;
for (int v = 0; v < n; v++) {
if (degrees[v] == 1) {
q.push(v);
}
}
while (!q.empty()) {
int v = q.front();
q.pop();
if (removed[v]) {
continue;
}
int p = -1;
for (const auto& e : graph[v]) {
if (removed[e.to]) {
continue;
}
p = e.to;
}
if (p == -1) {
return true;
}
vector<int> us;
for (const auto& e : graph[v]) {
if (removed[e.to]) continue;
if (e.to == p) continue;
us.push_back(e.to);
}
for (const auto& e : graph[p]) {
if (removed[e.to]) continue;
if (e.to == v) continue;
us.push_back(e.to);
}
for (int u : us) {
degrees[u]--;
if (degrees[u] == 1) {
q.push(u);
}
}
degrees[v] = 0;
degrees[p] = 0;
removed[v] = true;
removed[p] = true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
if (Solve()) {
cout << "First" << endl;
} else {
cout << "Second" << endl;
}
}
| 0
| 97,906,466
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define ALL(x) (x).begin(),(x).end()
signed _main(); signed main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
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; }
template<class T> using v = vector<T>;
template<class T> using vv = vector<v<T>>;
const int MOD=1e9+7;
const long long INF = 1LL << 60;
using P=pair<int,int>;
using Graph = vector<vector<int>>;
signed _main(){
int N, M; cin >> N >> M;
Graph G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--,b--;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i,N){
if(SZ(G[i])%2==1){
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_in_out ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main()
{
fast_in_out;
int n;
cin >> n;
set <int> v;
for(int i = 0; i < n; i++)
{
int x;
cin >> x;
v.insert(x);
}
if(v.size() < n)
{
cout << "NO";
}
else
{
cout << "YES";
}
}
| 0
| 89,707,054
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
double T,X;
cin>>T>>X;
cout<<T/X;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#define DF(x) x.erase(x.begin())
#define ALL(x) x.begin(), x.end()
#define SORT(x) sort(ALL(x))
#define REVERSE(x) reverse(ALL(x))
#define init() \
cin.tie(0); \
ios::sync_with_stdio(false)
#define debug(x) cerr << "[debug] " << #x << ": " << x << endl;
#define debugV(v) \
cerr << "[debugV] " << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl;
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using P = pair<ll, ll>;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
constexpr ld PI = 3.141592653589793238462643383279;
ll get_digit(ll x) {
return to_string(x).size();
}
ll gcd(ll x, ll y) {
return y ? gcd(y, x % y) : x;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
vector<P> factorize(ll n) {
vector<P> result;
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
result.pb({i, 0});
while (n % i == 0) {
n /= i;
result.back().second++;
}
}
}
if (n != 1) {
result.pb({n, 1});
}
return result;
}
vll divisor(ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
}
}
SORT(ret);
return (ret);
}
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;
}
signed main() {
init();
ll N;
cin >> N;
COUT(N / 3);
return 0;
}
| 0
| 46,069,956
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No \
cout << "No" << endl; \
return 0;
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template <typename T>
void print(const T &v);
int main()
{
int N;
string S;
cin >> N >> S;
vector<int> alp(26, 0);
for (char c : S)
{
alp[c - 'a']++;
}
ll ans = 1;
for (int a : alp)
{
ans = (ans * (a + 1)) % MOD;
}
if (ans != 0)
{
cout << ans - 1 << endl;
}
else
{
cout << MOD - 1 << endl;
}
return 0;
}
template <typename T>
void print(T const &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << " ";
cout << v[i];
}
cout << endl;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
const int INF=1e9;
ll gcd(ll x,ll y){
if(y==0) return 0;
return gcd(y,x%y);
}
int main(){
int x,y;cin>>x>>y;
int ans=0;
if(x>=0){
if(y>=x) ans=y-x;
else if(0<y&&y<x) ans=1+(x-y)+1;
else if(-x<y&&y<=0) ans=1+x+y;
else ans=-y-x+1;
}else{
if(y<=x) ans=1+(x-y)+1;
else if(x<y&&y<=0) ans=y-x;
else if(0<y&&y<=-x) ans=(-y-x)+1;
else ans=1+y+x;
}
cout<<ans<<endl;
return 0;
}
| 0
| 6,309,862
|
#include "bits/stdc++.h"
#pragma warning(disable:4996)
using namespace std;
int main() {
int a;
map<int, int>mp;
while (cin >> a) {
mp[a]++;
}
int amax = 0;
vector<int>anss;
for (auto m : mp) {
if (m.second > amax) {
anss.clear();
amax = m.second;
}
if (m.second == amax) {
anss.push_back(m.first);
}
}
sort(anss.begin(), anss.end());
for (auto ans : anss) {
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
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; }
const int INF = 1e18;
signed main(){
int n, z, w; cin >> n >> z >> w;
int a[n];
REP(i,n){
cin >> a[i];
if(n == 1){
cout << abs(a[i]-w) << endl;
return 0;
}
}
cout << max(abs(a[n-1] - w), abs(a[n-2] - a[n-1])) << endl;
}
| 0
| 97,032,598
|
#include <iostream>
#include <cstring>
using namespace std;
struct edge{
int node;
edge *next;
}nodes[105];
int n,matrix[105][105];
int main()
{
memset(matrix,0,sizeof(matrix));
cin>>n;
int i,j;
for(i=1;i<=n;i++){
int ii,n_i;
cin>>ii>>n_i;
for(j=0;j<n_i;j++){
int jj;
cin>>jj;
matrix[ii][jj]=1;
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(j!=1)cout<<" ";
cout<<matrix[i][j];
}
cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <iterator>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<long long>
#define vc vector<char>
#define vvc vector<vector<char> >
#define vpi vector<pair<int,int> >
#define ll long long
#define sz(a) int(a.size())
#define forn(i,n) for(int i = 0 ; i < int(n) ; i++)
#define all(x) x.begin(),x.end()
#define vpl vector<pair<long long,long long> >
#define F first
#define S second
#define mp make_pair
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pci pair<char,int>
#define len(s) s.length()
#define un unsigned
# define M_PI 3.14159265358979323846
#define modulo 998244353ll
#define mod 1000000007ll
#define MAXN 1000001
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll power(ll a,ll b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
void solve()
{
int n,m;
cin>>n>>m;
vi row[n];
vi col[m];
vvc path(n,vc (m,'.'));
forn(i,n)
{
forn(j,m)
{
cin>>path[i][j];
if(path[i][j] == '#')
{
row[i].pb(j);
col[j].pb(i);
}
}
}
int ans = 0;
forn(i,n)
{
forn(j,m)
{
if(path[i][j] == '.')
{
int temp = 0;
int ind = upper_bound(all(row[i]),j)-row[i].begin();
if(ind == row[i].size())
{
temp += m-1;
}
else
{
temp += row[i][ind]-1;
}
if(ind-1 >= 0)
temp -= row[i][ind-1];
else
{
temp -= -1;
}
ind = upper_bound(all(col[j]),i) - col[j].begin();
if(ind == col[j].size())
{
temp += n-1;
}
else
{
temp += col[j][ind]-1;
}
if(ind-1 >= 0)
{
temp -= col[j][ind-1];
}
else
{
temp -= -1;
}
ans = max(ans,temp-1);
}
}
}
cout<<ans<<endl;
}
int main()
{
fast();
int t;
t = 1;
while(t--)
solve();
return 0;
}
| 0
| 88,278,231
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
char a,b;
cin >> a >> b;
cout << (a==b ? 'H' : 'D');
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef set<int>::iterator sit;
typedef map<int, int>::iterator mit;
typedef vector<int>::iterator vit;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = 1e6 + 3;
#define _ % MOD
#define __ %= MOD
#define each(it, s) for (auto it = s.begin(); it != s.end(); ++it)
#define sortA(v) sort(v.begin(), v.end())
#define sortD(v) sort(v.begin(), v.end(), greater<auto>())
#define fill(a) memset(a, 0, sizeof(a))
#define swap(a, b) \
{ \
a = a + b; \
b = a - b; \
a = a - b; \
}
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repA(i, a, n) for (ll i = a; i <= (n); ++i)
#define repD(i, a, n) for (ll i = a; i >= (n); --i)
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define pv(a) \
{ \
rep(i, a.size()) cout << a[i] << " "; \
cout << endl; \
}
#define mark(v) cout << "Here--" << v << endl;
const double EPS = (1e-7);
int dcmp(double x, double y) { return fabs(x - y) <= EPS ? 0 : x < y ? -1 : 1; }
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll power(ll x, ll y)
{
ll res = 1;
while (y > 0)
{
if (y & 1)
res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ans = INF;
repA(i, -100, 100)
{
ll sum = 0;
rep(j, n) sum += power(a[j] - i, 2);
ans = min(ans, sum);
}
cout << ans << endl;
return 0;
}
| 0
| 73,651,026
|
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(void)
{
int z=-1,n,i,j[255],o,maxo=-100000,s[5000]={0};
scanf("%d",&n);
while(n!=0){
o=0;
z++;
for(i=0;i<n;i++){
scanf("%d",&s[i]);
}
for(i=1;i<n;i++){
if(s[i]<s[i-1]+s[i]){
s[i]=s[i-1]+s[i];
}
}
for(i=0;i<n;i++){
maxo=max(maxo,s[i]);
}
j[z]=maxo;
maxo=-100000;
scanf("%d",&n);
}
for(i=0;i<=z;i++){
printf("%d\n",j[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MAX=100005;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define sum(v) accumulate(ALL(v),0)
#define fi first
#define se second
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
int len=v.size();
for(int i=0; i<len; ++i) {
s<<v[i];
if(i<len-1) s<<" ";
}
return s;
}
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
int len=vv.size();
for(int i=0; i<len; ++i) {
s<<vv[i]<<endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout<<std::setprecision(10);
ll n,a,b;
cin>>n>>a>>b;
if((b-a)%2==0){
cout<<"Alice"<<endl;
}else{
cout<<"Borys"<<endl;
}
return 0;
}
| 0
| 64,779,760
|
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
int cnt1,cnt2;
vector<int>letak;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin>>s;
for(int i=0;i<s.size();i++){
char isi=s[i];
if(isi=='B')letak.pb(i);
}
ll byk=letak.size();
int idx=s.size()-1-byk+1;
ll ans=0;
for(auto isi:letak){
ans+=(idx-isi);
idx++;
}
cout<<ans<<endl;
}
|
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
struct UnionFind {
private:
const int n;
int size_;
vector<int> uf;
public:
UnionFind(int _n) : n(_n), size_(_n), uf(_n, -1) {}
int find(int x) {return (uf[x] < 0) ? x : uf[x] = find(uf[x]);}
bool same(int x, int y) {return find(x) == find(y);}
int size(int x) {return -uf[find(x)];}
int size() {return size_;}
bool unite(int x, int y) {
x = find(x); y = find(y);
if(x == y) return false;
size_--;
if(-uf[x] < -uf[y]) swap(x, y);
uf[x] += uf[y]; uf[y] = x;
return true;
}
};
void expr() {
ll N, M; scanf("%lld%lld", &N, &M);
vector< pair<int, int> > edges;
for(int i=0; i<M; i++) {
int u, v;
scanf("%d%d", &u, &v); u--; v--;
if(u > v) swap(u, v);
edges.emplace_back(u, v);
}
vector< tuple<int, int, int, int> > edges_2d;
for(int i=0; i<M; i++) {
for(int j=0; j<M; j++) {
int a0, a1; tie(a0, a1) = edges[i];
int b0, b1; tie(b0, b1) = edges[j];
for(int k=0; k<2; k++) {
edges_2d.emplace_back(a0, b0, a1, b1);
swap(b0, b1);
}
}
}
sort(edges_2d.begin(), edges_2d.end());
UnionFind uf(N*N);
for(auto e : edges_2d) {
int a0, b0, a1, b1; tie(a0, b0, a1, b1) = e;
int x = a0 * N + b0, y = a1 * N + b1;
uf.unite(x, y);
fprintf(stderr, "(%d, %d) <-> (%d, %d)\n", a0, b0, a1, b1);
}
for(int i=0; i<N; i++) {
for(int j=0; j<N; j++) {
int x = i * N + j;
fprintf(stderr, "%2d ", uf.find(x));
}
fprintf(stderr, "\n");
}
cerr << uf.size() << endl;
exit(0);
}
int main() {
int N, M; scanf("%d%d", &N, &M);
vector< vector<int> > G(N);
vector<int> visited(N, -1);
for(int i=0; i<M; i++) {
int u, v; scanf("%d%d", &u, &v);
u--; v--;
G[u].emplace_back(v);
G[v].emplace_back(u);
}
int free_v = 0;
vector<int> A, B;
{
bool bipartite = true;
int cnt = 0;
auto dfs = [&](auto&& self, int cur) -> void {
cnt++;
for(auto to : G[cur]) {
if(visited[to] >= 0) {
bipartite &= (visited[to] ^ visited[cur]) == 1;
}
else {
visited[to] = visited[cur] ^ 1;
self(self, to);
}
}
};
for(int i=0; i<N; i++) {
if(visited[i] >= 0) continue;
bipartite = true;
visited[i] = 0;
cnt = 0;
if(G[i].size() == 0) free_v++;
else {
dfs(dfs, i);
if(bipartite) A.emplace_back(cnt);
else B.emplace_back(cnt);
}
}
}
ll ans = 2LL*free_v*N - 1LL*free_v*free_v;
ll X = A.size(), Y = B.size();
ans += 2*X*X + 2*X*Y + Y*Y;
cout << ans << endl;
return 0;
}
| 0
| 25,829,837
|
#include <iostream>
using namespace std;
int main(void){
int d;
while(cin >> d){
int COUNT = 0;
for (int i = d; 600 > i; i = i + d){
int j = i * i * d;
COUNT = COUNT + j;
}
cout << COUNT << endl;
}
return 0;
}
|
#include<cstdio>
using namespace std;
int n, a, b, p;
int ans[1001010];
int x, y, r;
int cal(int x, int y){
return (x+y-1) / y;
}
int main(){
scanf("%d%d%d", &n, &a, &b);
if(a == 1 && b != n){
printf("-1");
return 0;
}
if(b == 1 && a != n){
printf("-1");
return 0;
}
if(a == 1){
for(int i = n; i >= 1; i --)
printf("%d ", i);
return 0;
}
if(b == 1){
for(int i = 1; i <= n; i ++)
printf("%d ", i);
return 0;
}
if(a+b > n+1){
printf("-1");
return 0;
}
if(cal(n-a, b-1) > a){
printf("-1");
return 0;
}
int cnt = n - a;
x = (cnt-b+1) / (a-1);
y = (cnt-b+1) % (a-1);
int r1, r2 = n - a;
for(int i = cnt+1; i <= n; i ++){
ans[++p] = i;
}
for(int i = 1; i <= x; i ++){
r1 = r2 - a + 1;
for(int j = r1; j <= r2; j ++){
ans[++p] = j;
}
r2 -= a;
}
r1 = r2 - y;
for(int i = r1; i <= r2; i ++)
ans[++p] = i;
for(int i = r1 - 1; i >= 0; i --)
ans[++p] = i;
for(int i = 1; i <= n; i ++)
printf("%d ", ans[i]);
return 0;
}
| 0
| 37,252,243
|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
ll H,W,N;
cin >> H >> W >> N;
map<P,int> mp;
rep(i,0,N){
int a,b;
cin >> a >> b;
a--,b--;
int dx[] = {-1,-1,-1,0,0,0,1,1,1};
int dy[] = {-1,0,1,-1,0,1,-1,0,1};
rep(j,0,9){
int ny = a + dy[j];
int nx = b + dx[j];
if(ny < 1 || ny >= H-1 || nx < 1 || nx >= W-1)continue;
mp[P(ny, nx)]++;
}
}
ll cnt[10] = {}, sum = 0;
for(auto p:mp){
cnt[p.second]++;
}
rep(i,0,10)sum += cnt[i];
cnt[0] = (H-2) * (W-2) - sum;
rep(i,0,10){
cout << cnt[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long a, b, c; cin >> a >> b >> c;
long long add = a%b;
if(add == 0){
if(add == c)
cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}
for(long long i=add; i<=10000; i+=add)
{
if(i%b == c%b){
cout<<"YES";
return 0; }
}
cout<<"NO"<<endl;
return 0;
}
| 0
| 88,085,230
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k;
cin >> k;
string arr;
cin >> arr;
if(k < arr.length())
{
for(int i=0; i<k; i++)
cout << arr[i];
cout << "...";
}
else
{
cout << arr;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const vector<int> dx = {1, 0, -1, 0};
const vector<int> dy = {0, 1, 0, -1};
const double PI = 3.1415926535;
const ll inf = 1001001001;
const ll e9 = 1000000000;
const ll mod = 1000000007;
const int MAX = 1000000;
const int MOD = 1000000007;
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
int main(){
int n;
cin >> n;
vector<int>p(n),p2(n);
rep(i, 0, n)cin >> p[i];
int mx = 200200, cnt=0;
rep(i, 0, n){
chmin(mx,p[i]);
p2[i] = mx;
}
rep(i,0,n){
if(i==0){
cnt++;
continue;
}else{
if(p2[i-1]>=p[i]){
cnt++;
}
}
}
cout << cnt << endl;
}
| 0
| 15,357,382
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i,j,r,g,b,k;
cin>>r>>g>>b;
cin>>k;
int k1=0;
while(g<=r)
{
g*=2;
k1++;
}
if(k1>k)
{
cout<<"No";
return 0;
}
while(b<=g)
{
b*=2;
k1++;
}
if(k1>k)
{
cout<<"No";
return 0;
}
cout<<"Yes";
}
|
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
typedef long long int lint;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i % 2;
}
sort(all(a));
int ans = 0;
for (int i = 0; i < n / 2; i++) {
if (a[2 * i + 1].second == 0) {
ans++;
}
}
cout << ans << endl;
}
| 0
| 16,771,755
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i,x,n) for(int i=x;i<n;i++)
#define all(c) c.begin(),c.end()
#define int ll
#define print(x) cerr << (#x) << "is "<< x << "\n"
using ll = long long;
using pii = pair<int,int>;
const int MOD = 1e9+7, N = 1e5 + 10;
int32_t main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int x; cin >> x;
for(int i=0;i<s.length();i+=x){
cout << s[i];
}
return 0;
}
|
#include <numeric>
#include <iostream>
#include <array>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
#include <utility>
#include <deque>
#include <queue>
using namespace std;
#define ll long long int
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repp(i, n) for(ll i = 1; i <= n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define riverse(v) reverse((v).begin(), (v).end())
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
using vi = vector<int>;
using vs = vector<string>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vb = vector<bool>;
using vvb = vector<vb>;
const ll MOD = 1e9 + 7;
vi alphabet = { 'a','b','c','d','e','f','g','h','i','j','k','l','m',
'n','o','p','q','r','s','t','u','v','w','x','y','z' };
ll Foo(ll num) {
ll a;
if ((num % 4) == 0) a=num;
else if ((num % 4) == 1) a=1;
else if ((num % 4) == 2) a=num+1;
else a=0;
return a;
}
int main() {
ll A, B;
cin >> A >> B;
ll ans;
if (A == 0) ans = Foo(B);
else {
ll a = Foo(A-1);
ll b = Foo(B);
ans = a ^ b;
}
cout << ans << endl;
}
| 0
| 3,201,359
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <stack>
using namespace std;
int main() {
string s[5];
cin >> s[0] >> s[1] >> s[2];
cout << (char)(s[0][0] + 'A' - 'a') << (char)(s[1][0] + 'A' - 'a') << (char)(s[2][0] + 'A' - 'a');
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
while(1) {
int H,W;
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int a = 0; a < W; a++) {
printf("#");
}
printf("\n");
for(int b=0+1;b<H-1; b++){
printf("#");
for(int c=0+1;c<W-1;c++){
printf(".");
}
printf("#");
printf("\n");
}
for(int d = 0; d < W; d++) {
printf("#");
}
printf("\n");
printf("\n");
}
return 0;
}
| 0
| 91,921,895
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
class union_find{
int n;
vector<int> p;
public:
union_find(int n):n(n),p(n,-1){}
int find(int u){ return p[u]<0?u:p[u]=find(p[u]); }
void unite(int u,int v){
u=find(u); v=find(v);
if(u!=v){
if(p[v]<p[u]) swap(u,v);
p[u]+=p[v]; p[v]=u; n--;
}
}
bool is_same(int u,int v){ return find(u)==find(v); }
int size()const{ return n; }
int size(int u){ return -p[find(u)]; }
};
int main(){
int n,q; scanf("%d%d",&n,&q);
union_find U(n);
rep(_,q){
int t,u,v; scanf("%d%d%d",&t,&u,&v);
if(t==0) U.unite(u,v);
else printf("%d\n",U.is_same(u,v));
}
return 0;
}
|
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#define _CRT_DISABLE_PERFCRIT_LOCKS
#define POPCNTI(a) __builtin_popcount(a)
#define fs first
#define sc second
#include <bits/stdc++.h>
using namespace std;
#define error(args...) \
{ \
cerr<<"LINE "<<__LINE__; \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
cerr<<endl; \
}
void err(istream_iterator<string> it)
{
}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
cerr<<' '<< *it << " = " << a ;
err(++it, args...);
}
typedef long long ll;
inline void WRITE_CHAR(char c) {putchar_unlocked(c);}
template<typename T>
inline bool READn (T &result) {
int minus = 1;
char ch;
result=0;
ch = (char) getchar_unlocked();
while (!isdigit(ch) && ch!=EOF) minus = (ch == '-'? -1 : minus),ch= (char) getchar_unlocked();
if(ch==EOF) return false;
while (isdigit(ch)) result = result*10 + (int) (ch - '0'),ch = (char) getchar_unlocked();
result *= minus;
return ch;
}
template<typename T>
inline void WRITEn(T x) {
if (x < 0) {putchar_unlocked('-'); x = -x; }
char writeBuffer[20], *writePtr = writeBuffer;
do {
*writePtr++ = (char)('0' + x % 10);
x /= 10;
}
while (x);
do { putchar_unlocked(*--writePtr); }
while (writePtr > writeBuffer);
}
inline bool Read_CHAR(char &c)
{
char READ_CHARACTER = (char)getchar_unlocked();
while ((READ_CHARACTER == '\n' || READ_CHARACTER == '\t' || READ_CHARACTER == ' ')) READ_CHARACTER = (char)getchar_unlocked();
if(READ_CHARACTER == EOF) return false;
c = READ_CHARACTER;
return true;
}
inline bool READ_CHAR_ARRAY(char *x) {
char READ_CHARACTER = (char)getchar_unlocked();
while ((READ_CHARACTER == '\n' || READ_CHARACTER == '\t' || READ_CHARACTER == ' ')) READ_CHARACTER = (char)getchar_unlocked();
if(READ_CHARACTER == EOF) return false;
char *ptr = &x[0];
while ((READ_CHARACTER != '\n' && READ_CHARACTER != '\t' && READ_CHARACTER != ' ' && READ_CHARACTER != EOF)) *ptr++ = READ_CHARACTER, READ_CHARACTER = (char)getchar_unlocked();
*ptr = '\0';
return true;
}
inline void WRITE_CHAR_ARRAY(const char *x) {
while(*x != '\0')
putchar_unlocked(*x++);
}
inline void WRITE_STRING(string &x) {
for(char c: x)
putchar_unlocked(c);
}
template<typename T>
inline bool READ_DOUBLE(T &x) {
double y;
if(scanf("%lf", &y) == EOF) return false;
x = y;
return true;
}
template <typename T>
inline void WRITE_DOUBLE(T x) {
printf("%.15f", (double)x);
}
const ll OOl = 1e18 ;
const int N = 1e7+1,OO = 1e9,OOm = 0x3f3f3f3f, MOD = 1e9 + 7;
set<int> s;
int freq[N];
int main()
{
int n;
READn(n);
for(int i=0;i<n;++i)
{
int x;READn(x);
freq[x]++;
s.insert(x);
}
int ans = 0;
for(auto x:s)
{
bool f = 1;
if(x == 1)
{
if(freq[x]>1) f=0;
}
else if(freq[x]>1) f=0;
else
{
if(freq[1]) f=0;
else
{
for(ll i=2;(i*i)<=x;++i)
{
if((x%i == 0) && (freq[i] || freq[x/i]) )
{
f = 0;
break;
}
}
}
}
ans+=f;
}
WRITEn(ans);
return 0;
}
| 0
| 62,180,683
|
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i,m,n) for(ll i=(m); (i)<(ll)(n); ++(i))
#define REP(i,n) FOR(i,0,n)
#define MAX 10000+1
void countingSort(const ll* const a, ll* const b, ll* const c, const ll k, const ll n){
REP(i,k) c[i] = 0;
REP(i,n) ++c[a[i]];
FOR(i,1,k) c[i] += c[i-1];
for(ll i=n-1; i>=0; --i) b[(c[a[i]]--)-1] = a[i];
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n; cin >> n;
ll a[n], b[n], c[MAX];
REP(i,n) cin >> a[i];
countingSort(a, b, c, MAX, n);
REP(i,n) cout << b[i] << " \n"[i==n-1];
return 0;
}
|
#include <iostream>
#include <cstdlib>
#include <queue>
#include <cstring>
using namespace std;
typedef long long ll;
const int N=500010;
char c[N];
int ru[N],ans[N],hed[N],ver[N],nex[N],tot;
ll sum;
queue<int> q;
void add(int x,int y)
{
tot++;
ver[tot]=y;
nex[tot]=hed[x];
hed[x]=tot;
}
int main()
{
int i,x,y;
cin>>c;
int n=strlen(c);
for(i=0;i<n;i++)
{
if(c[i]=='<')
{
add(i,i+1);
ru[i+1]++;
}
else
{
add(i+1,i);
ru[i]++;
}
}
for(i=0;i<=n;i++)
{
if(ru[i]==0)
{
ans[i]=0;
q.push(i);
}
}
while(!q.empty())
{
x=q.front();
q.pop();
for(i=hed[x];i;i=nex[i])
{
y=ver[i];
ru[y]--;
ans[y]=max(ans[y],ans[x]+1);
if(ru[y]==0) q.push(y);
}
}
for(i=0;i<=n;i++) sum+=ans[i];
cout<<sum;
return 0;
}
| 0
| 9,216,173
|
#include <iostream>
using namespace std;
int main(){
string S;cin >> S;
string R = S.substr(0,4);
string T = S.substr(4,8);
cout << R << " " << T << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using v = vector<T>;
template <class T>
using vv = v<v<T>>;
#define ALL(c) (c).begin(), (c).end()
using Graph = vv<int>;
v<bool> seen;
int dfs(const Graph &G, int v)
{
seen[v] = true;
bool all = true;
for (int i = 0; i < seen.size(); i++)
{
if (!seen[i])
all = false;
}
if (all)
return 1;
int ans = 0;
for (auto next_v : G[v])
{
if (seen[next_v])
continue;
ans += dfs(G, next_v);
seen[next_v] = false;
}
return ans;
}
int main()
{
int N, M;
cin >> N >> M;
Graph G(N);
for (int i = 0; i < M; i++)
{
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
seen.assign(N, false);
cout << dfs(G, 0) << endl;
return 0;
}
| 0
| 75,538,069
|
#include<bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define F first
#define S second
#define ld long double
#define rep(i,a,n) for (ll i= (a) ; i < (n); ++i)
#define vi vector<ll>
#define all(v) (v).begin(),(v).end()
#define M_PI 3.14159265358979323846
const ll MOD = 1e9 + 7;
const ll INF = 1e18L + 5;
void solve() {
string s, t;
cin >> s >> t;
int ans = 0;
rep(i, 0, s.size()) {
if ( s[i] != t[i])
ans++;
}
cout << ans<<endl;
}
int main() {
int t = 1;
ll k = 1;
while (t--) {
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
int flag=0;
for(int i=0; i<a.length(); i++)
{
if(a[i]==b[a.length()-1-i])
continue;
else
flag=1;
}
if(flag==0)
cout<<"YES";
else
cout<<"NO";
return 0;
}
| 0
| 4,097,623
|
#include <bits/stdc++.h>
using namespace std;
vector<int> levelup(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
int main() {
int N,M;
cin >> N >> M;
vector<int> k(M);
vector<vector<int>> ks(M,vector<int>(N,0));
vector<int> p(M);
for(int i=0;i<M;i++){
cin >> k[i];
for(int j=0;j<k[i];j++){
cin >> ks[i][j];
}
}
for(int i=0;i<M;i++){
cin >> p[i];
}
int inde = 1;
for(int i=0;i<N;i++){
inde *= 2;
}
vector<int> vec(N,0);
int countans=0;
int count = 0;
for(int i=0;i<inde;i++){
for(int j=0;j<M;j++){
int countt=0;
for(int l=0;l<k[j];l++){
if(vec[ks[j][l]-1]==1){
countt++;
}
}
if(countt%2==p[j]){
count++;
}
}
if(count==M){
countans++;
}
if(i==inde-1){
break;
}
count = 0;
vec = levelup(vec,N);
}
cout << countans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pop pop_back
#define V vector
#define P pair
#define V2(a,b,c) V<V<int>> a(b,V<int>(c))
#define V2a(a,b,c,d) V<V<int>> a(b,V<int>(c,d))
#define incin(a) int a; cin>>a
#define yuko(a) setprecision(a)
template<class T>
void cou(vector<vector<T>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}
int wari(int a,int b) {
if(a%b==0)
return a/b;
else
return a/b+1;
}
int keta(int a){
double b=a;
b=log10(b);
int c=b;
return c+1;
}
int souwa(int a){
return a*(a+1)/2;
}
int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}
bool prime(int a){
if(a<2)
return false;
else if(a==2)
return true;
else if(a%2==0)
return false;
double b=sqrt(a);
for(int i=3;i<=b;i+=2){
if(a%i==0){
return false;
}
}
return true;
}
struct Union{
vector<int> par;
Union(int n){
par= vector<int>(n, -1);
}
int find(int x){
if(par[x]<0)
return x;
else
return par[x]=find(par[x]);
}
bool same(int a,int b){
return find(a)==find(b);
}
int Size(int a){
return -par[find(a)];
}
void unite(int a,int b){
a=find(a);
b=find(b);
if(a==b)
return;
if(Size(b)>Size(a))
swap<int>(a,b);
par[a]+=par[b];
par[b]=a;
}
};
int ketas(int a){
string b=to_string(a);
int c=0;
fo(i,keta(a)){
c+=b[i]-'0';
}
return c;
}
signed main(){
int a;
cin>>a;
cout<<180*(a-2)<<endl;
}
| 0
| 93,952,728
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
vector<int> a(130, 0);
for(int i=0; i<s.size(); ++i) ++a[s[i]];
for(int i=97; i<=122; ++i){
if(!a[i]) { cout << char(i) << endl; return 0; }
}
cout << "None" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) (int)a.size()
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main()
{
int a,b;
cin >> a >> b;
cout << (a < b ? 0 : 10);
}
| 0
| 22,237,806
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
template<class T> void view(T e) {cout << e << endl;}
template<class T> void view(const vector<T> &v) {for(const auto &e : v){cout << e << " ";} cout << endl;}
template<class T> void view(const vector<vector<T>> &vv) {for(const auto &v : vv){view(v);}}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
ll gcd(ll a, ll b) {return(b?gcd(b,a%b):a);}
ll lcm(ll a, ll b) {return(a/gcd(a,b)*b);}
int main() {
int x; cin >> x;
ll lm = lcm(x,360);
int ans = lm / x;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
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; }
int main(){
ll h, w, k, ans = 0;
cin >> h >> w >> k;
vector<vector<char> > c(w, vector<char>(h));
rep(y, h){
rep(x, w){
cin >> c.at(x).at(y);
}
}
rep(bit, (1<<(h+w))){
bitset<12> tmp(bit);
vector<vector<char> > m = c;
rep(i, h){
if(tmp.test(i)) {
rep(x, w){
m.at(x).at(i) = '.';
}
}
}
rep2(i, h, h+w){
if(tmp.test(i)) {
rep(y, h){
m.at(i-h).at(y) = '.';
}
}
}
int count = 0;
rep(y, h){
rep(x, w){
if(m.at(x).at(y) == '#'){
count++;
}
}
}
if(count == k){
ans++;
}
}
cout << ans << endl;
}
| 0
| 77,927,131
|
#include <stdio.h>
int main(){
char s[1001];
char r,c;
int i,v=0,j,h;
while(1){
scanf("%s",s);
if(s[0]=='0') break;
else{
for(i=0;s[i]!='\0';i++){
v=v+s[i]-'0';
}
printf("%d\n",v);
v=0;
}
}
return 0;
}
|
#include <iostream>
#include <cmath>
int n;
int k;
int dp[100200];
int h[100001];
int main() {
std::cin >> n >> k;
for (int i = 0; i < n; i++) {
dp[i] = 2000000000;
std::cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= k; j++) {
if (dp[i] + abs(h[i + j] - h[i]) < dp[i + j]) {
dp[i + j] = dp[i] + abs(h[i + j] - h[i]);
}
}
}
std::cout << dp[n - 1] << std::endl;
}
| 0
| 98,119,403
|
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(),(x).end()
#define sq(x) ((x)*(x))
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)
#define EQ(a,b) (abs((a)-(b))<eps)
template<class T> void chmin(T& a,const T& b){if(a>b)a=b;}
template<class T> void chmax(T& a,const T& b){if(a<b)a=b;}
#define MOD 1000000007ll
struct ModInt{
ll val;
ModInt():val(0ll){}
ModInt(ll v):val(((v%MOD)+MOD)%MOD){}
ModInt exp(ll y)const{
if(!y)return ModInt(1ll);
ModInt a = exp(y/2ll);
a *= a;
if(y&1)a*=(*this);
return a;
}
bool operator==(const ModInt& x)const{return val==x.val;}
inline bool operator!=(const ModInt& x)const{return !(*this==x);}
bool operator<(const ModInt& x)const{return val<x.val;}
bool operator>(const ModInt& x)const{return val>x.val;}
inline bool operator>=(const ModInt& x)const{return !(*this<x);}
inline bool operator<=(const ModInt& x)const{return !(*this>x);}
ModInt& operator+=(const ModInt& x){if((val+=x.val)>=MOD)val-=MOD;return *this;}
ModInt& operator-=(const ModInt& x){if((val+=MOD-x.val)>=MOD)val-=MOD;return *this;}
ModInt& operator*=(const ModInt& x){(val*=x.val)%=MOD;return *this;}
ModInt operator+(const ModInt& x)const{return ModInt(*this)+=x;}
ModInt operator-(const ModInt& x)const{return ModInt(*this)-=x;}
ModInt operator*(const ModInt& x)const{return ModInt(*this)*=x;}
};
istream& operator>>(istream&i,ModInt&x){i>>x.val;return i;}
ostream& operator<<(ostream&o,const ModInt&x){o<<x.val;return o;}
int n,m;
int x[100100],y[100100];
ModInt X,Y;
int main(){
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++)scanf("%d",&x[i]);
for(int i=0;i<m;i++)scanf("%d",&y[i]);
int s = 1-n;
for(int i=0;i<n;i++){
X += ModInt(x[i])*ModInt(s);
s += 2;
}
s = 1-m;
for(int i=0;i<m;i++){
Y += ModInt(y[i])*ModInt(s);
s += 2;
}
cout << X*Y << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int s;
cin>>s;
map<int,int> mp;
int tmp =1,ans;
mp[s]=tmp;
while(true){
tmp++;
if(s%2==0){
s/=2;
if(mp.count(s)){
ans=tmp;
break;
}
mp[s]=tmp;
}else{
s=3*s+1;
if(mp.count(s)){
ans=tmp;
break;
}
mp[s]=tmp;
}
}
cout<<ans<<endl;
}
| 0
| 4,853,300
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define n_p(v) next_permutation(v.begin(),v.end())
#define print(a) cout<<(a)<<endl;
#define to_ll(b) stoll(b)
#define MOD 1000000007
int main(){
ll N,K; cin>>N>>K;
vi vec(0);
map<ll,ll> mp;
rep(i,0,N){
ll a,b; cin>>a>>b;
mp[a]+=b;
}
ll ans=0;
for(auto p:mp){
K-=p.second;
if(K<=0){
ans=p.first;
break;
}
}
cout<<ans;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>>a(h,vector<char>(w));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin >> a.at(i).at(j);
}
}
vector<vector<int>>cost(h,vector<int>(w));
cost.at(0).at(0)=(a.at(0).at(0)=='#');
for(int i=1;i<w;i++){
if(a.at(0).at(i-1)=='.'&&a.at(0).at(i)=='#')
cost.at(0).at(i)=cost.at(0).at(i-1)+1;
else
cost.at(0).at(i)=cost.at(0).at(i-1);
}
for(int i=1;i<h;i++){
if(a.at(i-1).at(0)=='.'&&a.at(i).at(0)=='#')
cost.at(i).at(0)=cost.at(i-1).at(0)+1;
else
cost.at(i).at(0)=cost.at(i-1).at(0);
}
for(int i=1;i<h;i++){
for(int j=1;j<w;j++){
cost.at(i).at(j)=min(cost.at(i-1).at(j)+(a.at(i-1).at(j)=='.'&&a.at(i).at(j)=='#'),cost.at(i).at(j-1)+(a.at(i).at(j-1)=='.'&&a.at(i).at(j)=='#'));
}
}
cout << cost.at(h-1).at(w-1) << endl;
return 0;
}
| 0
| 68,636,425
|
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <cstdio>
#include <math.h>
#include <cmath>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <random>
#include <iomanip>
#include <bitset>
using namespace std;
template<typename T> void uin(T &a, T b) {
if (b < a) {
a = b;
}
}
template<typename T> void uax(T &a, T b) {
if (b > a) {
a = b;
}
}
#define left left228
#define right right228
#define set set228
const int maxn = 200 * 1000 + 228;
int n;
int a[maxn];
struct block
{
int len, d;
block() {}
block(int _len, int _d) {
len = _len;
d = _d;
}
};
int D;
vector<block> v;
void add(block b) {
if (v.empty()) {
v.push_back(b);
} else {
if (v.back().d == b.d) {
v.back().len += b.len;
} else {
v.push_back(b);
}
}
}
void del(int k) {
while (v.back().len <= k) {
k -= v.back().len;
v.pop_back();
}
if (k) {
v.back().len -= k;
}
}
void inclast() {
if (v.back().len == 1) {
int curd = v.back().d;
v.pop_back();
add({1, curd + 1});
} else {
--v.back().len;
int d = v.back().d;
add({1, d + 1});
}
}
void inc() {
if (v.back().d != D - 1) {
inclast();
} else {
int len = v.back().len;
v.pop_back();
inclast();
add({len, 0});
}
}
bool check(int x) {
D = x;
v.clear();
v.push_back({a[1], 0});
for (int i = 2; i <= n; ++i) {
if (a[i] > a[i - 1]) {
add(block(a[i] - a[i - 1], 0));
} else {
del(a[i - 1] - a[i]);
if ((int)v.size() == 1 && v[0].d == x - 1) {
return 0;
}
inc();
}
}
return 1;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int l = 0, r = n;
while (r - l > 1) {
int mid = (l + r) >> 1;
if (check(mid)) {
r = mid;
} else {
l = mid;
}
}
cout << r << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
using namespace std;
int main(){
int x ; cin >> x;
int ans = 0;
if(x >= 400 && x <= 599)ans = 8;
if(x >= 600 && x <= 799)ans = 7;
if(x >= 800 && x <= 999)ans = 6;
if(x >= 1000 && x <= 1199)ans = 5;
if(x >= 1200 && x <= 1399)ans = 4;
if(x >= 1400 && x <= 1599)ans = 3;
if(x >= 1600 && x <= 1799)ans = 2;
if(x >= 1800 && x <= 1999)ans = 1;
cout << ans << endl;
return 0;
}
| 0
| 37,556,370
|
#include <iostream>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string taro,hanako;
int tp=0,hp=0;
int turn;
cin>>turn;
for(int i=0;i<turn;i++){
cin>>taro>>hanako;
for(int j=0;j<taro.size();j++){
if(isupper(taro[j]))
taro[j] = tolower(taro[j]);
}
for(int i=0;i<hanako.size();i++){
if(isupper(hanako[i]))
hanako[i] = tolower(hanako[i]);
}
if(taro.compare(hanako)<0)
hp+=3;
else if(taro.compare(hanako)>0)
tp+=3;
else{
tp++;
hp++;
}
}
cout<<tp<<" "<<hp<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) 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--)
ll digitnum(ll N){
ll count = 0,x,hako;
for(ll i = 1;i <= N;i++){
x = 0;
hako = i;
while(hako > 0){
hako /= 10;
x++;
}
if(x % 2 != 0)
count++;
}
return count;
}
int main(){
ll N,ans=0;
cin >> N;
ans = digitnum(N);
cout << ans << endl;
return 0;
}
| 0
| 21,990,504
|
#include <bits/stdc++.h>
using namespace std;
#define point pair<int ,int>
#define x first
#define y second
int n;
vector <point> vs;
double ang(point p){
if(p.x >= 0 && p.y >= 0 || p.x <= 0 && p.y >= 0)
return acos(p.x/sqrt(1LL*p.x*p.x + 1LL*p.y*p.y));
return 7-acos(p.x/sqrt(1LL*p.x*p.x + 1LL*p.y*p.y));
}
long long sqr(long long num){
return num*num;
}
int main()
{
scanf("%d",&n);
for(int a,b,i=0; i<n; i++){
scanf("%d%d",&a,&b);
if(a||b)
vs.push_back({a ,b});
}
n = vs.size();
sort(vs.begin() ,vs.end() ,[](point p1 ,point p2){
return ang(p1) < ang(p2);
});
vs.insert(vs.end() ,vs.begin() ,vs.end());
long long ans = 0LL ,sx = 0LL ,sy = 0LL;
for(int i=0,j=0; i<n; i++){
while(j-i+1<=n && j < vs.size() && sqr(sx+vs[j].x)+sqr(sy+vs[j].y) > sqr(sx)+sqr(sy))
sx += vs[j].x ,sy += vs[j].y ,j++;
ans = max(ans ,sqr(sx)+sqr(sy));
sx -= vs[i].x ,sy -= vs[i].y;
}
printf("%.10f\n",sqrt(ans));
}
|
#include<iostream>
using namespace std;
int main(){
int a,b,c;
int flag=0;
cin>>a>>b>>c;
if(a<b){
if(b<c){
flag=1;
}
}
if(flag){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
}
| 0
| 8,422,836
|
#include<bits/stdc++.h>
using namespace std;
long long n,i,a,b;
int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b)
{
return (a*b)/gcd(a, b);
}
int main()
{
cin>>a>>b;
if(gcd(a,b)==1)
cout<<a*b<<endl;
else
cout<<lcm(a,b);
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
int s = 0;
for (int i=0; i<n; i++){
cin >> a[i];
s += a[i];
}
int ans = 0;
if (s % n == 0) {
int x = s/n;
for (int i: a){
ans += (x - i)*(x - i);
}
}
else {
int x1 = ceil((double) s/n);
int x2 = floor((double) s/n);
int ans1 = 0;
int ans2 = 0;
for (int i: a){
ans1 += (x1 - i)*(x1 - i);
ans2 += (x2 - i)*(x2 - i);
}
if (ans1 > ans2){
ans = ans2;
}
else{
ans = ans1;
}
}
cout << ans;
}
| 0
| 31,555,308
|
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
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() {
string s;
cin >> s;
int w;
cin >> w;
string ans = "";
for (int i = 0; i < s.size(); i += w) ans += s[i];
cout << ans << endl;
}
|
#include <utility>
#include <iostream>
#include <algorithm>
using namespace std;
int v,A[100][100],u,k,w;
int main(){
cin >> v ;
for (int i=0; i<v; ++i){
cin >> u >> k;
for(int j=0; j<k; ++j){
cin >> w;
A[u-1][w-1] = 1;
}
}
for (int i=0; i<v; ++i){
for (int j=0; j<v; ++j){
cout << A[i][j];
if (j < v-1)
cout << " ";
}
cout << endl ;
}
}
| 0
| 95,234,015
|
#include <iostream>
#include <vector>
int main()
{
int n, t;
std::cin >> n >> t;
std::vector<int> arr(n);
for (int i = 0; i < n; ++i)
{
int tmp;
std::cin >> tmp;
arr[i] = tmp;
}
int64_t sum = 0;
for (int i = 0; i < n; ++i)
{
if (i != n - 1)
{
sum += std::min(arr[i + 1] - arr[i], t);
}
else
{
sum += t;
}
}
std::cout << sum << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
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;
}
#define MAX 1000
typedef pair<int, int> P;
int h, w;
char a[MAX][MAX];
int d[MAX][MAX];
int dy[4] = {-1, 0, 1, 0};
int dx[4] = {0, 1, 0, -1};
queue<P> que;
void bfs() {
while (que.size()) {
P p = que.front();
que.pop();
for (int i = 0; i < 4; i++) {
int ny = p.first + dy[i];
int nx = p.second + dx[i];
if (0 <= ny && ny < h && 0 <= nx && nx < w && a[ny][nx] == '.' && d[ny][nx] == INT_MAX) {
d[ny][nx] = d[p.first][p.second] + 1;
que.emplace(P(ny, nx));
}
}
}
return;
}
int main() {
cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> a[i][j];
if (a[i][j] == '#') {
d[i][j] = 0;
que.emplace(P(i, j));
}
else {
d[i][j] = INT_MAX;
}
}
}
bfs();
int ans = 0;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
chmax(ans, d[i][j]);
}
}
cout << ans << endl;
}
| 0
| 49,681,591
|
#include <iostream>
#include<cstdio>
#include<string>
#include<stdio.h>
using namespace std;
int main() {
int count[300] = {0};
char word;
while ((word = getchar()) !=EOF) {
count[word]++;
}
for (int i = 97; i <= 122; i++)printf("%c : %d\n", i, count[i] + count[i - 32]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int N;
cin >> N;
vector<int> V1(100010), V2(100010);
rep(i, N/2){
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
V1.at(tmp1)++;
V2.at(tmp2)++;
}
vector<int> V1_sort = V1, V2_sort = V2;
int V1_max = 0, V2_max = 0, V1_max2, V2_max2, V1_a, V2_a;
sort(V1_sort.rbegin(), V1_sort.rend());
sort(V2_sort.rbegin(), V2_sort.rend());
V1_max = V1_sort.at(0);
V1_max2 = V1_sort.at(1);
V2_max = V2_sort.at(0);
V2_max2 = V2_sort.at(1);
int ans = 0;
for(int i = 1; i < N/2; i++){
ans += V1_sort.at(i) + V2_sort.at(i);
}
rep(i, 100010){
if(V1.at(i) == V1_max){
V1_a = i;
}
if(V2.at(i) == V2_max){
V2_a = i;
}
}
if(V1_a == V2_a){
int change1 = V1_max - V1_max2, change2 = V2_max - V2_max2;
if(change1 > change2) ans += change2;
else ans += change1;
}
cout << ans << endl;
}
| 0
| 68,976,786
|
#include<bits/stdc++.h>
#define MOD 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define forf(i,a,b) for(i=a;i<b;i++)
#define forr(i,a,b) for(i=a;i>b;i--)
#define mp make_pair
#define f first
#define s second
#define pb(x) push_back(x)
typedef long long int ll;
typedef std::vector<ll> vi;
#define input(vec,a,b) for(ll i =a;i<b;i++) cin>>vec[i]
#define print(vec,a,b) for(ll i=a;i<b;i++) cout<<vec[i]<<" " ;cout<<endl;
#define all(a) a.begin(),a.end()
using namespace std;
void solve(){
ll i,j,n,k;
cin>>n>>k;
ll h[n],c[n];
for(i=0;i<n;i++)
cin>>h[i];
c[0]=0;
c[1]=abs(h[0]-h[1]);
for(i=2;i<n;i++)
{
ll mi=c[i-1]+abs(h[i]-h[i-1]);
for(j=2;j<=k&&j<=i;j++)
mi=min(mi,c[i-j]+abs(h[i]-h[i-j]));
c[i]=mi;
}
cout<<c[n-1];
}
int main()
{
IO;
ll t=1;
while(t--)
{
solve();
}
return 0;
}
|
#include <iostream>
#include <string>
#include <queue>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
int main(){
int n;
cin >> n;
int cnt = 0;
int building[12][10] = {{0}};
int b, f, r, v;
int left, right = 0;
for(int i=0; i<n; i++){
cin >> b >> f >> r >> v;
left = (b-1)*3 + f-1;
right = r-1;
building[left][right] += v;
}
for(int i=0; i<12; i++){
for(int j=0; j<10; j++){
cout <<" " << building[i][j];
}
cout << endl;
if( (i%3 == 2) && (cnt<3)){
cout << "####################" << endl;
cnt++;
}
}
return 0;
}
| 0
| 75,360,291
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int x, y; cin >> x >> y;
rep(i, x+1) {
int j = x - i;
if(2*i + 4*j == y) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
|
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
struct stu
{
int x,y;
};
stu vp[90005];
int k[90005];
int main()
{
int h,w,d,num;
scanf("%d %d %d",&h,&w,&d);
for(int i=1;i<=h;i++)
{
for(int j=1;j<=w;j++)
{
scanf("%d",&num);
vp[num].x=i;
vp[num].y=j;
}
}
for(int i=d+1;i<=h*w;i++)
{
k[i]=k[i-d]+abs(vp[i].x-vp[i-d].x)+abs(vp[i].y-vp[i-d].y);
}
int q;
scanf("%d",&q);
for(int i=0;i<q;i++)
{
int x,y;
scanf("%d %d",&x,&y);
printf("%d",abs(k[y]-k[x]));
if(i!=q-1)
printf("\n");
}
}
| 0
| 79,186,680
|
#include "iostream"
#include "vector"
#include "string"
#include "algorithm"
#include "math.h"
#include "cstring"
#include "stack"
#include "queue"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll> > mat;
int main()
{
int n, k;
cin >> n >> k;
cout << n - k + 1 << "\n";
}
|
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int cnt[26];
signed main(){
ios_base::sync_with_stdio(0);
string s;
cin>>s;
for(int i=0;i<sz(s);i++) cnt[s[i]-'A']++;
int tmp=0;
for(int i=0;i<26;i++) if(cnt[i]==2) tmp++;
cout<<(tmp==2?"Yes":"No");
re 0;
}
| 0
| 95,183,979
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
string s[55];
int cnt[55][26];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for(int i=0;i<n;i++){
cin >> s[i];
for(int j=0;j<s[i].length();j++){
cnt[i][s[i][j]-'a']++;
}
}
for(int i=0;i<26;i++){
int mn = 1e9;
for(int j=0;j<n;j++){
mn = min(mn, cnt[j][i]);
}
for(int j=0;j<mn;j++) printf("%c", i+'a');
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
ll n; cin >> n;
map<ll, ll, greater<ll>> m;
for(int i = 0; i < n; i++){
ll a; cin >> a;
m[a]++;
}
ll w = 0, h = 0;
for(auto p : m){
if(h > 0 && w > 0) break;
if(p.second >= 4){
if(h > 0){
w = p.first;
break;
}else{
cout << p.first * p.first << endl;
return 0;
}
}else if(p.second >= 2){
if(h == 0) h = p.first;
else w = p.first;
}
}
cout << w * h << endl;
}
| 0
| 79,498,754
|
#include <iostream>
#include <stdlib.h>
using namespace std;
int main()
{
char s[1001];
int x;
while(1)
{
cin.getline(s,1001);
if(atoi(s)==0)break;
int sum=0;
for(int i=0;s[i];i++)
sum+=int(s[i]-'0');
cout<<sum<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 99999999;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MAX_H = 1000;
int H, W;
string s[MAX_H];
bool inside(int x, int y) {
return 0 <= x && x < H && 0 <= y && y < W;
}
int bfs(int sx, int sy, int gx, int gy) {
queue<P> que;
que.push(P(sx, sy));
vector<vector<int>> d(H, vector<int>(W, INF));
d[sx][sy] = 0;
while (!que.empty()) {
P p = que.front(); que.pop();
if (p.first == gx && p.second == gy)
break;
rep(k, 4) {
int nx = p.first + dx[k], ny = p.second + dy[k];
if (inside(nx, ny) && s[nx][ny] != 'X' && d[nx][ny] == INF) {
que.push(P(nx, ny));
d[nx][ny] = d[p.first][p.second] + 1;
}
}
}
return d[gx][gy];
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N;
cin >> H >> W >> N;
N++;
vector<int> x(N);
vector<int> y(N);
rep(i, H) {
cin >> s[i];
rep(j, W) {
if (s[i][j] == 'S') s[i][j] = '0';
if (isdigit(s[i][j])) {
x[s[i][j] - '0'] = i;
y[s[i][j] - '0'] = j;
}
}
}
int ans = 0;
rep(i, N - 1) {
ans += bfs(x[i], y[i], x[i + 1], y[i + 1]);
}
cout << ans << endl;
}
| 0
| 81,271,625
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x, m;
cin >> n >> x >> m;
vector<long long> sm(100005, 0);
vector<long long> cnt(100005, 0);
sm[1] = x;
cnt[x] = 1;
long long first_sum = 0, first_len = 0;
long long loop_sum = 0, loop_len = 0, loop_num = 0;
long long last_sum = 0, last_len = 0;
long long a = x;
int i = 2;
for ( ; i <= n; i++ ) {
a = a * a % m;
if ( cnt[a] != 0 ) {
loop_len = i - cnt[a];
first_len = i-1 - loop_len;
first_sum = sm[first_len];
loop_sum = sm[i-1] - first_sum;
loop_num = (n - first_len) / loop_len;
last_len = (n - first_len) % loop_len;
last_sum = sm[first_len+last_len] - sm[first_len];
break;
}
sm[i] = a + sm[i-1];
cnt[a] = i;
}
long long ans = ( loop_num != 0 ) ? first_sum + (loop_sum*loop_num) + last_sum : sm[n];
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define lch (o << 1)
#define rch (o << 1 | 1)
typedef double db;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> pint;
const int N = (1 << 18) + 5;
const int INF = 0x3f3f3f3f;
const ll INF_LL = 0x3f3f3f3f3f3f3f3f;
int a[N];
pint b[N][2];
int ans[N];
int main(){
ios::sync_with_stdio(0);
int n; cin >> n;
int m = 1 << n;
for(int i=0; i<m; i++){
cin >> a[i];
for(int j=i; j<m; j = (j+1) | i){
if(a[i] >= b[j][0].fi){
b[j][1] = b[j][0];
b[j][0] = make_pair(a[i], i);
}else if(a[i] >= b[j][1].fi){
b[j][1] = make_pair(a[i], i);
}
}
}
for(int i=1; i<m; i++){
ans[i] = ans[i-1];
if(b[i][0].se != b[i][0].se)
ans[i] = max(ans[i], b[i][0].fi + b[i][0].fi);
if(b[i][0].se != b[i][1].se)
ans[i] = max(ans[i], b[i][0].fi + b[i][1].fi);
if(b[i][1].se != b[i][0].se)
ans[i] = max(ans[i], b[i][1].fi + b[i][0].fi);
cout << ans[i] << endl;
}
return 0;
}
| 0
| 35,680,465
|
#include <bits/stdc++.h>
using namespace std;
void solve(long long a, long long b, long long x){
double depth = (double)(x)/a/a;
double ad = a;
double bd = b;
double L, theta;
if(depth>bd/2){
L = sqrt(ad*ad + 4*(bd-depth)*(bd-depth));
theta = acos(a/L)/2.0/3.1415926589*360;
} else {
double y = 2.0*x/ad/bd;
L = sqrt(bd*bd+y*y);
theta = acos(y/L)/2.0/3.1415926589*360;
}
cout << setprecision(12) << theta << endl;
}
int main(){
long long a;
scanf("%lld",&a);
long long b;
scanf("%lld",&b);
long long x;
scanf("%lld",&x);
solve(a, b, x);
return 0;
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;
static const int INF = 999999999;
typedef pair<int, int> P;
struct SEdge
{
int To;
int Cost;
};
vector<int> d;
vector<SEdge> G[10];
void Dijkstra(int s)
{
fill(d.begin(), d.end(), INF);
d[s] = 0;
priority_queue<P, vector<P>, greater<P> > PQue;
PQue.push(P(0, s));
while(!PQue.empty())
{
P p = PQue.top();
PQue.pop();
if(d[p.second] < p.first)
{
continue;
}
int v = p.second;
for(int i = 0; i < G[v].size(); ++i)
{
SEdge e = G[v][i];
if(d[e.To] > d[v] + e.Cost)
{
d[e.To] = d[v] + e.Cost;
PQue.push(P(d[e.To], e.To));
}
}
}
}
void solve()
{
int E;
while(cin >> E, E)
{
int V = 0;
for(int i = 0; i < 10; ++i)
{
G[i].clear();
}
for(int i = 0; i < E; ++i)
{
int From, To, Cost;
cin >> From >> To >> Cost;
V = max(V, max(From, To));
SEdge e1, e2;
e1.To = To;
e2.To = From;
e1.Cost = e2.Cost = Cost;
G[From].push_back(e1);
G[To].push_back(e2);
}
++V;
d.clear();
d.resize(V);
unsigned long long int Min = INF;
int pos = 0;
for(int i = 0; i < V; ++i)
{
Dijkstra(i);
unsigned long long int sum = 0;
for(int j = 0; j < V; ++j)
{
sum += d[j];
}
if(Min > sum)
{
Min = sum;
pos = i;
}
}
cout << pos << " " << Min << endl;
}
}
int main()
{
solve();
return(0);
}
| 0
| 13,345,083
|
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
const double PI = acos(-1);
using ll= long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define fori(n) for(int i=0; i<int(n); i++)
#define cini(i) int i; cin>>i;
#define cins(s) string s; cin>>s;
#define cind(d) double d; cin>>d;
#define cinai(a,n) vi a(n); fori(n) { cin>>a[i]; }
#define cinas(s,n) vs s(n); fori(n) { cin>>s[i]; }
#define cinad(a,n) vd a(n); fori(n) { cin>>a[i]; }
using pii= pair<int, int>;
using pdd= pair<double, double>;
using vd= vector<double>;
using vb= vector<bool>;
using vi= vector<int>;
using vvi= vector<vi>;
using vs= vector<string>;
#define endl "\n"
int step(int a, int m) {
return (a*a)%m;
}
void solve() {
cini(n);
cini(x);
cini(m);
vi first(m, -1);
vi pre(2*m,0);
int ans=0;
for(int i=1; i<=n; i++) {
if(first[x]>=0) {
int loopsize=i-first[x];
int loopsum=pre[i-1]-pre[first[x]-1];
int loops=(n-i)/loopsize;
ans+=loops*loopsum;
i+=loops*loopsize;
for(int j=0; j<(int)first.size(); j++)
first[j]=-1;
}
if(i<(int)pre.size()) {
pre[i]=pre[i-1]+x;
first[x]=i;
}
ans+=x;
x=step(x,m);
}
cout<<ans<<endl;
}
signed main() {
solve();
}
|
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
ll Max(ll(a), ll(b), ll(c)) {
return max(max(a, b), c);
}
ll Min(ll(a), ll(b), ll(c)) {
return min(min(a, b), c);
}
int main() {
ll H, W, A, B;
cin >> H >> W >> A >> B;
rep(i, H) {
rep(j, W) {
if (i < B && j < A)cout << 0;
else if (i >= B && j >= A)cout << 0;
else cout << 1;
}
cout << endl;
}
}
| 0
| 57,823,343
|
#include <bits/stdc++.h>
using namespace std;
int k,a,b,c;
int main()
{
cin>>a>>b>>c>>k;
for (int i=0;i<=k;++i)
{
for (int j=0;j+i<=k;++j)
{
if (a<(b*(1<<i)) && (b*(1<<i))<(c*(1<<j)))
{
cout<<"Yes";
return 0;
}
}
}
cout<<"No";
return 0;
}
|
#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 whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
const ll mod = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};
int dist(P a, P b) {
return abs(a.first-b.first)+abs(a.second-b.second);
}
int main(){
int h, w, d;
cin >> h >> w >> d;
vector<vector<int>> a(h, vector<int>(w));
rep(i, h) rep(j, w) {
cin >> a[i][j];
a[i][j]--;
}
int q;
cin >> q;
vector<P> pos(h*w);
rep(i, h) rep(j, w) {
pos[a[i][j]] = P(i, j);
}
vector<vector<int>> mp(d, vector<int>(1));
rep(i, h*w) {
if (i/d==0) continue;
mp[i%d].push_back(mp[i%d].back()+dist(pos[i], pos[i-d]));
}
rep(i, q) {
int l, r;
cin >> l >> r;
l--; r--;
int x = l%d;
int ans = mp[x][r/d] - mp[x][l/d];
cout << ans << endl;
}
return 0;
}
| 0
| 43,196,522
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.