code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 45
101M
|
|---|---|---|---|
#include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a*500>=b) cout<<"Yes";
else cout<<"No";
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include<math.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; }
int main()
{
int64_t N;
cin >> N;
map<int64_t,int64_t>d;
for (int64_t i=0; i<N; i++) {
int64_t n;
cin >> n;
if (d.count(n) > 0) {
d[n] = d[n] + 1;
} else {
d[n] = 1;
}
}
int64_t max_count = 0;
for (auto s : d) {
int64_t b_v = 0;
if (d.count(s.first-1) > 0) {
b_v = d[s.first-1];
}
int64_t a_v = 0;
if (d.count(s.first+1) > 0) {
a_v = d[s.first+1];
}
int64_t count = a_v + b_v + s.second;
if (count > max_count) {
max_count = count;
}
}
cout << max_count << endl;
return 0;
}
| 0 | 60,781,263 |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[]) {
string alphs;
int m, h;
while(cin >> alphs){
if (alphs == "-") break;
cin >> m;
for (int i = 0; i < m; i++) {
cin >> h;
alphs = alphs + (alphs.substr(0, h));
alphs.erase(0, h);
}
cout << alphs << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
int cnt2 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
cnt++;
else {
if (cnt == 0)
cnt2++;
else
cnt--;
}
}
string res = "";
for (int i = 0; i < cnt2; i++) res.push_back('(');
res += s;
for (int i = 0; i < cnt; i++) res.push_back(')');
cout << res << endl;
}
| 0 | 15,022,123 |
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define INF64 1999999999999999999
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
ll n, s[110000], a, b, nm = INF;
int main() {
cin >> n;
REP(i, n)cin >> s[i];
sort(s, s + n, greater<ll>());
a = s[0];
REPO(i, n - 1) {
if (nm > min(abs(a / 2 - s[i]), abs((a + 1) / 2 - s[i]))) {
nm = min(abs(a / 2 - s[i]), abs((a + 1) / 2 - s[i]));
b = s[i];
}
}
cout << a << " " << b << endl;
}
|
#include <iostream>
#include<vector>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; i--)
#define srep(i,s,t) for (int i = s; i < t; i++)
#define rng(a) a.begin(),a.end()
using ll = long long;
using namespace std;
int main() {
int n;
cin>>n;
vector<int>a(n+1+1);
rrep(i,n+1) cin>>a[i];
vector<int>b(n+1+1);
rrep(i,n) cin>>b[i];
ll ans = 0;
rrep(i,n+1) {
if(a[i]>=b[i-1]) {
ans += b[i-1];
a[i] -= b[i-1];
} else {
ans += a[i];
a[i] = 0;
}
if(a[i]>=b[i]) {
ans += b[i];
b[i] = 0;
} else {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
}
}
cout<<ans<<endl;
return 0;
}
| 0 | 67,849,441 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=100010;
const ll mod=1e9+7;
int main(){
int n,k;
cin >> n >> k;
vector<P> s(n);
rep(i,n){ cin>>s[i].S>>s[i].F; }
sort(s.rbegin(),s.rend());
ll ans=0;
priority_queue<int,vector<int>,greater<int>> q;
vector<bool> type(mx,false);
ll cnt=0;
for(int i=0; i<k; i++){
ans += s[i].F;
if(!type[s[i].S]){ cnt++; type[s[i].S]=true; }else{ q.push(s[i].F); }
}
ans += cnt*cnt;
ll tmp=ans;
for(int i=k; i<n; i++){
if(cnt>=k){ break; }
if(type[s[i].S]){ continue; }
type[s[i].S]=true;
tmp = tmp+(cnt+1)*(cnt+1)-cnt*cnt+s[i].F-q.top();
ans = max(ans,tmp);
cnt++;
q.pop();
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAX_N = 5005;
const ll MAX_K = 5005;
const ll INF = 1LL << 40;
bool dp[MAX_N][MAX_K];
int main() {
int N;
ll K, A;
cin >> N >> K;
vector<ll> a;
for (int i = 0; i < N; i++) {
cin >> A;
a.push_back(A);
}
a.push_back(-1);
a.push_back(INF);
sort(a.begin(), a.end());
int left = 0, right = a.size() - 1;
while (right - left > 1) {
int mid = (right + left) / 2;
vector<ll> other_a;
for (int j = 1; j <= N; j++) {
if (mid == j) continue;
other_a.push_back(a[j]);
}
for (int j = 0; j <= N; j++) {
for (int k = 0; k < K; k++) dp[j][k] = false;
}
for (int j = 0; j < N; j++) dp[j][0] = true;
for (int j = 1; j <= other_a.size(); j++) {
for (ll k = 0; k < K; k++) {
dp[j][k] = dp[j - 1][k];
if (k - other_a[j - 1] >= 0) dp[j][k] |= dp[j - 1][k - other_a[j - 1]];
}
}
bool is_needed = false;
for (ll j = 0; j < K; j++) {
if (dp[N - 1][j] && j + a[mid] >= K) {
is_needed = true;
break;
}
}
if (!is_needed) left = mid;
else right = mid;
}
cout << left << endl;
return 0;
}
| 0 | 100,599,511 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
int n, A[3], ans;
vector<int> l;
char tmp[8];
void check(void)
{
vector<int> cnt(3, -1), sum(3, 0);
int s = 0;
rep(i, n)
{
sum[tmp[i] - 'A'] += l[i];
cnt[tmp[i] - 'A']++;
}
rep(i, 3)
{
if (cnt[i] >= 0)
s += cnt[i] * 10;
if (sum[i] > 0)
s += abs(A[i] - sum[i]);
else
return;
}
ans = min(ans, s);
}
void dfs(int depth = -1, int e = -1)
{
if (depth == n)
{
check();
return;
}
if (e != -1)
tmp[depth] = 'A' + e;
rep(i, 4)
{
dfs(depth + 1, i);
}
}
signed main(void)
{
cin >> n;
rep(i, 3) cin >> A[i];
l.resize(n);
rep(i, n) cin >> l[i];
ans = 1e9;
dfs();
cout << ans << endl;
return 0;
}
|
#include <iostream>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m,k;
cin >> n >> m>>k;
bool ok = false;
for(int i=0;i<=n;i++) {
for(int j=0;j<=m;j++) {
if (i * (m - j) + j * (n - i) == k) {
ok = true;
break;
}
}
}
if (ok) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
return 0;
}
| 0 | 61,089,701 |
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cerrno>
#include<clocale>
#include<cmath>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<utility>
#include<vector>
#include<cwchar>
#include<cwctype>
using namespace std;
#define ull unsigned long long
#define MOD 1000000007
#define ALL(a) (a).begin(), (a).end()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define ll long long
#define form(i,j,n) for(int i=int(j);i<=int(n);i++)
#define pb push_back
#define mk make_pair
#define pii pair<int,int>
#define pis pair<int,string>
#define sec second
#define sz(a) int((a).size())
ll ksm(ll a,ll b){ll res=1;a%=MOD;for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline int read()
{
char ch=getchar();
int x=0,f=1;
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=getchar();
return x*f;
}
ll s[100005];
ll ans;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n,k;
cin>>n>>k;
for(ll i=k;i>=1;i--)
{
ll x=k/i;
s[i]+=ksm(x,n);
for(int j=i*2;j<=k;j+=i)
{
s[i]=(s[i]-s[j]+MOD)%MOD;
}
ans=(ans+s[i]*i%MOD)%MOD;
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
using namespace std;
struct node{
int id;
int k;
int depth;
int parent;
vector<int> child;
};
int main()
{
int n, id, k;
cin >> n;
vector<node> tree;
tree.resize(n);
for (int i = 0; i < n; i++)
{
tree[i].parent = -1;
tree[i].depth = 0;
}
for (int i = 0; i < n; i++)
{
cin >> id >> k;
tree[id].id = id;
tree[id].k = k;
if (k != 0)
{
tree[id].child.resize(k);
for (int j = 0; j < k; j++)
{
cin >> tree[id].child[j];
}
}
}
for (int i = 0; i < n; i++)
{
if (tree[i].k != 0)
{
for(int j = 0; j < tree[i].k; j++)
{
tree[tree[i].child[j]].parent = tree[i].id;
}
}
}
for (int i = 0; i < n; i++)
{
int j = i;
while (tree[j].parent != -1)
{
j = tree[j].parent;
tree[i].depth++;
}
}
for (int i = 0; i < n; i++)
{
cout<< "node " << tree[i].id << ": " << "parent = " << tree[i].parent << ", " << "depth = " << tree[i].depth << ", ";
if (tree[i].k == 0 && tree[i].depth != 0)
{
cout << "leaf, []" << endl;
}
else
{
if (tree[i].depth == 0)
cout << "root, [";
else cout<< "internal node, [";
for (int j = 0; j < tree[i].k; j++)
{
cout << tree[i].child[j] ;
if (j != tree[i].k-1) cout << ", ";
}
cout << "]" << endl;
}
}
return 0;
}
| 0 | 12,999,533 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, A, B;
cin >> N >> A >> B;
if (A > B || (N == 1 && A != B)) {
cout << 0 << endl;
return 0;
}
ll min_s = A + (N-2) * A + B;
ll max_s = A + (N-2) * B + B;
ll ans = max_s - min_s + 1;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#define MAXV 10000
using namespace std;
int main() {
int n;
cin >> n;
vector<int> cnt(MAXV, 0);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
cnt[temp]++;
}
int count = 0;
for (int i = 0; i < cnt.size(); i++) {
while (cnt[i]) {
if (count)
cout << " ";
cout << i;
count++;
cnt[i]--;
}
}
cout << endl;
return 0;
}
| 0 | 56,443,955 |
#include <bits/stdc++.h>
using namespace std;;
int main(){
string s, t;
int sSize, tSize, ans, count;
cin >> s >> t;
sSize = s.size();
tSize = t.size();
ans = tSize;
for (int i = 0; i <= sSize-tSize; i++){
count = 0;
for (int j = 0; j < tSize; j++){
if (s[i + j] != t[j]){
count++;
}
}
ans = min(ans, count);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x[3];
for (int i = 0; i < 3; i++) {
cin >> x[i];
}
sort(x, x + 3);
int count = 0;
for (int i = 0; x[0] + 2 <= x[2]; i++) {
x[0] += 2;
count++;
}
for (int i = 0; x[1] + 2 <= x[2]; i++) {
x[1] += 2;
count++;
}
if (2 * x[2] - x[0] - x[1] == 1) count += 2;
if (2 * x[2] - x[0] - x[1] == 2) count += 1;
cout << count << endl;
}
| 0 | 84,641,288 |
#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 A,B,C;
cin >> A >> B >> C;
set<int> check;
bool ans;
int x = A;
while(true){
x = x%B;
if(x == C){
ans = true;
break;
}else if(check.count(x)){
ans = false;
break;
}
check.insert(x);
x += A;
}
if(ans){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
}
|
#include <iostream>
#include <vector>
#include <utility>
#include <set>
using namespace std;
typedef pair<int, int> P;
int main(){
int N, K;
cin >> N >> K;
int cnt = 0;
if(K > (N - 1) * (N - 2) / 2){
cout << -1 << endl;
return 0;
}
set<P> s;
for(int i = 1; i < N; i++){
cnt++;
s.insert(P(1, i + 1));
}
int cntp = (N - 1) * (N - 2) / 2;
int flag = 0;
for(int i = 2; i <= N; i++){
if(flag == 1) break;
for(int j = i + 1; j <= N; j++){
if(cntp == K){
flag = 1;
break;
}
s.insert(P(i, j));
cnt++;
cntp--;
}
}
cout << cnt << endl;
for(auto p: s){
cout << p.first << ' ' << p.second << endl;
}
}
| 0 | 15,400,289 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,x;
cin>>a>>b;
x=__gcd(a,b);
x=(a*b)/x;
cout<<x;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define PB push_back
#define MP make_pair
#define endl '\n'
#define all(a) (a).begin(),(a).end()
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int arr[100000][3];
int n;
int dp[100000][3];
int rec(int row, int col)
{
if(row == n-1) return arr[n-1][col];
if(dp[row][col]>0)
return dp[row][col];
else if(col==0)
return dp[row][col]=arr[row][col]+max(rec(row+1,1),rec(row+1,2));
else if(col==1)
return dp[row][col]=arr[row][col]+max(rec(row+1,0),rec(row+1,2));
else if(col==2)
return dp[row][col]=arr[row][col]+max(rec(row+1,0),rec(row+1,1));
}
int main()
{
optimize();
cin>>n;
for(int i=0;i<n;i++)
{
for(int j=0;j<3;j++)
cin>>arr[i][j];
}
int x=max(rec(0,0),max(rec(0,1),rec(0,2)));
cout<<x;
return 0;
}
| 0 | 80,273,999 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(){
vector<int> h(10);
for(int i=0;i<10;++i) cin>>h[i];
sort(begin(h),end(h),greater<int>());
for(int i=0;i<3;++i) cout<<h[i]<<endl;
return 0;
}
|
#include<iostream>
#include<math.h>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
string s;
cin >> s;
vector<int> c(s.size(),0);
for(int i=0;i<s.size();i++){
if(s[i]=='a')c[0]++;
if(s[i]=='b')c[1]++;
if(s[i]=='c')c[2]++;
}
if(c[0]==1 && c[1]==1 && c[2]==1)cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
| 0 | 8,226,537 |
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n)
using namespace std;
int main()
{
MaRiaMa;
int k = 1;
string s;
cin >> s;
for (int i = 0; i < 4; i++)
{
if (s[i] == s[i + 1])
{
k++;
if (k >= 3)
{
cout << "Yes";
return 0;
}
}
else
k = 1;
}
cout << "No";
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
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;
}
int main(){
int n;
cin >> n;
map<ll, ll> mp;
for(int i = 0; i < n; i++){
ll a;
cin >> a;
mp[a]++;
}
ll ans = 0;
for(auto b : mp){
if(b.first < b.second){
ll x = b.second - b.first;
ans += min(x, b.second);
}
else if(b.first > b.second){
ans += b.second;
}
}
cout << ans << endl;
return 0;
}
| 0 | 36,813,185 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;
#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<int, int, ll> T;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
template<typename T, typename U>
size_t operator()(const pair<T, U> &x) const {
size_t seed = hash<T>()(x.first);
return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
}
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);
int n;
ll a[200100], b[200100];
ll solve() {
ll min_b = inf;
ll sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i] && min_b > b[i]) {
min_b = b[i];
}
sum += a[i];
}
if (min_b >= inf) return 0;
return sum - min_b;
}
void input() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
input();
cout << solve() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pr(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define all(v) (v).begin(), (v).end()
#define int unsigned long long
#define sz(v) (int)(v).size()
#define mod 1000000007
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
const int N= 10000001;
int b[N];
void solve() {
int n; cin >> n;
int sm= 1;
for (int i = 2; i <= n; i++) {
for (int j = i; j <= n; j+= i) b[j]+= 1;
sm+= i* (b[i]+ 1);
}
cout << sm<< "\n";
}
int32_t main(){
ios::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
int T= 1;
while ( T-- ) {
solve();
}
return 0;
}
| 0 | 34,625,259 |
#include<iostream>
using namespace std;
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#define int long long int
int function2(int memo[],int turn[],int n,map<int,int> &sticks)
{
if(n<0)
{
return -1000000000;
}
if(n==0)
{
return 0;
}
if(memo[n]!=-1)
{
return memo[n];
}
else
{
map<int,set<int>> mp;
int here=-1000000000;
mp[here].insert(-1);
for(auto &p:sticks)
{
int val=1+function2(memo,turn,n-p.second,sticks);
mp[val].insert(p.first);
}
auto it=mp.end();
it--;
int answer=*it->second.rbegin();
turn[n]=answer;
memo[n]=it->first;
return it->first;
}
}
int32_t main()
{
int answer=0;
int n;
cin>>n;
int j;
for(j=0;j<n;j++)
{
int x;
cin>>x;
answer=__gcd(answer,x);
}
cout<<answer<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
vec<string> S(2);
cin >> S[0] >> S[1];
if (S[0].size() > S[1].size()) {
cout << "GREATER" << endl;
} else if (S[0].size() < S[1].size()) {
cout << "LESS" << endl;
} else if (S[0] == S[1]) {
cout << "EQUAL" << endl;
} else {
string A = S[0];
sort(all(S));
if (A == S[0]) {
cout << "LESS" << endl;
} else {
cout << "GREATER" << endl;
}
}
}
| 0 | 79,457,938 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
#define ll long long
#define Size(v) (int)v.size()
using namespace std;
void solve() {
ll x;
cin >> x;
ll lcm = x * 360 / __gcd(x, 360LL);
cout << lcm / x;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
while (t--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<bool> > vvb;
typedef vector<vector<double> > vvd;
typedef vector<vector<string> > vvs;
typedef vector<ll> vl;
typedef vector<vector<ll> > vvl;
typedef vector<vector<vector<ll> > > vvvl;
ll MOD = 1000000007;
const long long L_INF = 1LL << 60;
const int INF = 2147483647;
const double PI = acos(-1);
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> void debug(T v){rep(i,v.size()) cout<<v[i]<<" ";cout<<endl;}
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
signed main(){
gearup;
ll n;cin >> n;
vl a(n);
rep(i,n)cin>>a[i];
sort(rall(a));
queue<int> q;
int j = 0;
while(j+1<n){
if(a[j] == a[j+1]){
q.push(a[j]);
j+=2;
}
else{
j++;
}
}
ll res = 0;
if(q.size() >= 2){
ll a = q.front();q.pop();
ll b = q.front();q.pop();
res = a*b;
}
out(res);
}
| 0 | 1,714,549 |
#include <iostream>
using namespace std;
int s,x,z,a;
int main(){
cin>>x>>a>>z;
s=a+x;
if((a<=500)&&(a>=1)&&(x>=1)&&(x<=500)){
if(s>=z){
cout<<"Yes";
} else {
cout << "No";
}
}
else{
cout<<"you can't buy";
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -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; }
inline int gcd(int a, int b) { return (a%b == 0) ? b : gcd(b, a%b); }
inline int fac(int n) { return (n==0) ? 1 : n * fac(n - 1); }
int main() {
int n;
cin >> n;
vector<int> p(n), q(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
cin >> q[i];
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
a[i] = i + 1;
}
int a_pos = -1, b_pos = -1;
int n_fac = fac(n);
for (int i = 0; i < n_fac; i++)
{
if (a == p)
{
a_pos = i;
}
if (a == q)
{
b_pos = i;
}
if (a_pos != -1 && b_pos != -1)
{
break;
}
else
{
next_permutation(a.begin(), a.end());
}
}
cout << abs(a_pos - b_pos) << endl;
return 0;
}
| 0 | 70,649,271 |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cctype>
#include<queue>
#include<vector>
inline int read() {
int x = 0, f = 1; char c = getchar();
for (; !isdigit(c); c = getchar()) f ^= c == '-';
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
return f ? x : -x;
}
using namespace std;
const int yuzu = 1e5;
int d[yuzu | 10],k;
void bfs(int u, int dep) {
memset(d, 0x3f, sizeof d);
queue<int> q;
q.push(1), d[1] = 1;
for (; !q.empty();) {
int u = q.front();q.pop();
int net = u * 10 % k;
if (d[net] > d[u]) {
q.push(net);
d[net] = d[u];
}
net = (u + 1) % k;
if (d[net] > d[u] + 1) {
q.push(net);
d[net] = d[u] + 1;
}
}
}
int main() {
k = read();
bfs(1, 1);
cout << d[0]<<endl;
}
|
#pragma region macro
#include <bits/stdc++.h>
typedef long long int64;
using namespace std;
using P = pair<int64, int64>;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const int64 INF = 1LL << 62;
const int inf = 1<<30;
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; }
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i,s,n) for (int i = s; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << "\n";
#define mp make_pair
#define bn '\n'
template <typename T>
ostream& operator<<(ostream& os, const vector<T> &V){
int N = V.size();
REP(i,N){
os << V[i];
if (i!=N-1) os << " ";
}
os << "\n";
return os;
}
template <typename T,typename S>
ostream& operator<<(ostream& os, pair<T,S> const&P){
os << "(";
os << P.first;
os << " , ";
os << P.second;
os << ")";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, set<T> &S){
auto it=S.begin();
while(it!=S.end()){
os << *it;
os << " ";
it++;
}
os << "\n";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, deque<T> &q){
for(auto it=q.begin();it<q.end();it++){
os<<*it;
os<<" ";
}
os<<endl;
return os;
}
vector<pair<int,int>> dxdy = {mp(0,1),mp(1,0),mp(-1,0),mp(0,-1)};
#pragma endregion
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int64> A(N);
REP(i,N) cin >> A[i];
int ans=0;
map<int64,int> cnt;
REP(i,N){
if(i&1){
cnt[A[i]]++;
}
}
sort(ALL(A));
REP(i,N){
if(i&1){
if(cnt[A[i]]==0){
ans++;
}else{
cnt[A[i]]--;
}
}
}
cout << ans << endl;
}
| 0 | 33,688,299 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))
#define print(x) printf("%d\n",x)
using namespace std;
typedef unsigned int uint;
typedef long long ll;
const int _dx[] = {0,1,0,-1};
const int _dy[] = {-1,0,1,0};
int getInt(){
int ret = 0,c;
c = getchar();
while(!isdigit(c)) c = getchar();
while(isdigit(c)){
ret *= 10;
ret += c - '0';
c = getchar();
}
return ret;
}
int cnt[60*60*24 + 1];
int main(){
int n;
while(scanf("%d",&n), n){
int h,m,s,hh,mm,ss;
memset(cnt, 0, sizeof(cnt));
REP(i,n){
scanf("%d:%d:%d %d:%d:%d",&h,&m,&s,&hh,&mm,&ss);
int st = h * 3600 + m * 60 + s;
int ed = hh* 3600 + mm* 60 + ss;
do{
++cnt[st];
}while(++st < ed);
}
int ans = 0;
REP(i,60*60*24+1)
ans = max(ans, cnt[i]);
print(ans);
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int W;
int H;
int x;
int y;
int r;
int f1;
int f2;
int f3;
int f4;
cin>>W>>H>>x>>y>>r;
bool t = false;
if (x-r>=0){
if(t) cout<<"1Yes"<<endl;
f1=1;
}else if (x-r<0){
if(t) cout<<"1No"<<endl;
f1=0;
}
if (y+r<=H){
if(t) cout<<"2Yes"<<endl;
f2=1;
}else if (y+r>H){
if(t) cout<<"2No"<<endl;
f2=0;
}
if (x+r<=W){
if(t) cout<<"3Yes"<<endl;
f3=1;
}else if (x+r>W){
if(t) cout<<"3No"<<endl;
f3=0;
}
if (y-r>=0){
if(t) cout<<"4Yes"<<endl;
f4=1;
}else if (y-r<0){
if(t) cout<<"4No"<<endl;
f4=0;
}
if (f1==1&&f2==1&&f3==1&&f3==1&&f4==1){
cout<<"Yes"<<endl;
}else {
cout<<"No"<<endl;
}
return 0;
}
| 0 | 54,666,112 |
#include <iostream>
#include <cstring>
#include <cctype>
#define MAX_LEN (1200)
using namespace std;
int main()
{
char* str = new char[MAX_LEN + 1];
int* counter = new int[26];
int lest = MAX_LEN;
for (int i = 0; i < 26; i++) {
counter[i] = 0;
}
while (cin.getline(str, lest)) {
for (int i = 0; str[i] != '\0'; i++) {
if (str[i] >= 'A' && str[i] <= 'Z') {
str[i] = tolower(str[i]);
}
if (str[i] >= 'a' && str[i] <= 'z') {
int num = str[i] - 'a';
counter[num]++;
}
}
lest -= strlen(str);
}
for (int i = 0; i < 26; i++) {
cout << (char)('a' + i) << " : " << counter[i] << endl;
}
delete[] str;
delete[] counter;
return (0);
}
|
# include <bits/stdc++.h>
# define long long long
# define all(vc) vc.begin(),vc.end()
# define allr(vc) vc.rbegin(),vc.rend()
# define pb push_back
# define fi first
# define se second
# define pi pair <long, long>
# define lcm(a, b) (a * b) / __gcd(a, b)
using namespace std;
const long N = 100100;
void read(){freopen("input.txt" , "r" , stdin );freopen("output.txt", "w" , stdout );}
long dp[N][2];
void solve(){
long a;
cin >> a;
vector <long> v(a);
for(auto &i: v) cin >> i;
long mx = 0, ans = 0;
for (int i = 0; i < a; ++i){
if( mx < v[i] ){
mx = v[i];
continue;
}
if( mx == v[i] ) continue;
ans += mx - v[i];
}
cout << ans;
}
int32_t main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
long T = 1;
while( T-- ){
solve();
cout<<'\n';
}
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
| 0 | 54,295,935 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
cout << c << endl;
return 0;
}
else if (b == c) {
cout << a << endl;
return 0;
} else if (a == c) {
cout << b << endl;
return 0;
}
}
|
#include<bits/stdc++.h>
#define ll long long
#define P pair<ll ,ll>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int r,s,p;
cin >> r >> s >> p;
string t;
cin >> t;
ll ans = 0;
vector<char>was(n ,'x');
for(int i=0;i<n;i++){
if(i-k >=0){
if(was[i-k]!='r' && t[i]=='r'){
ans += p;
was[i] = 'r';
}
if(was[i-k]!='s' && t[i]=='s'){
ans += r;
was[i] = 's';
}
if(was[i-k]!='p' && t[i]=='p'){
ans += s;
was[i] = 'p';
}
}else{
if( t[i]=='r'){
ans += p;
was[i] = 'r';
}
if( t[i]=='s'){
ans += r;
was[i] = 's';
}
if( t[i]=='p'){
ans += s;
was[i] = 'p';
}
}
}
cout << ans << endl;
}
| 0 | 19,079,823 |
#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i));
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
template<class T> void chmax(T &a, const T &b){if(a<b) a=b;}
template<class T> void chmin(T &a, const T &b){if(b<a) a=b;}
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
int main() {
int n; cin >> n;
vi dp(n + 1, INT_MAX);
int a, length = 1;
rep(i, 0, n) {
cin >> a;
if(dp[length - 1] < a) dp[length++] = a;
else *lower_bound(dp.begin(), dp.begin() + length, a) = a;
}
P(length);
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
LL modpow(LL a, LL b, LL mod = kMod) {
LL r = 1;
while (b) {
if (b % 2 == 1) r = r * a % mod;
a = a * a % mod;
b /= 2;
}
return r;
}
int main() {
LL N, K; cin >> N >> K;
vector<LL> dp(K + 1);
dp[0] = 0;
for (int k = 1; k <= K; ++k) {
int x = K/k;
dp[k] = modpow(x, N) % kMod;
}
LL total = 0;
for (int k = K; k > 0; --k) {
for (int j = 2; j * k <= K; ++j) {
dp[k] = (dp[k] + kMod - dp[j*k]) % kMod;
}
LL item = dp[k] * k % kMod;
total = (total + item) % kMod;
}
cout << total << endl;
}
| 0 | 64,601,252 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int N,K,X,Y;
cin>>N>>K>>X>>Y;
if(N<=K){cout<<X*N<<endl;}
else{cout<<X*K+(N-K)*Y<<endl;}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k > (n - 1) * (n - 2) / 2) {
cout << -1 << endl;
return 0;
}
cout << n - 1 + (n - 1) * (n - 2) / 2 - k << endl;
for (int i = 2; i <= n; ++i) {
cout << 1 << " " << i << endl;
for (int j = i + 1; j <= n; ++j)
if (k < (n - 1) * (n - 2) / 2)
++k, cout << i << " " << j << endl;
}
return 0;
}
| 0 | 41,724,449 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
const double PI (acos(-1));
int main()
{
char C;
cin >> C;
C = C + 'b' - 'a';
cout << C;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1e9+7;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
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 ll LOG_N=30;
int main(){
ll N;
cin >> N;
vector<ll> x(N);
rep(i,N) cin >> x[i];
ll L,Q;
cin >> L >> Q;
vector<vector<ll>> next(LOG_N,vector<ll>(N,-1));
rep(i,N){
ll y=upper_bound(x.begin(),x.end(),x[i]+L)-x.begin()-1;
next[0][i]=y;
}
rep(i,LOG_N-1){
rep(j,N){
next[i+1][j]=next[i][next[i][j]];
}
}
rep(i,Q){
ll a,b,ans=0;
cin >> a >> b;
if (a>b) swap(a,b);
--a,--b;
for (int i=LOG_N-1;i>=0;--i){
if (next[i][a]<b){
ans+=1<<i;
a=next[i][a];
}
}
++ans;
cout << ans << endl;
}
}
| 0 | 3,624,624 |
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000007
using namespace std;
int n,a[200010],cnt;
pair<int,int> q[200010];
inline bool check(int x)
{
if(x==1){
bool flag=false;
for(int i=1;i<n;i++) if(a[i]>=a[i+1]){
flag=true;
break;
}
if(!flag) return true;
return false;
}
int pre=0;
map<int,int> mp;
mp.clear();
for(int i=1;i<=n;i++){
if(a[i]<=pre){
pre=a[i];
while(pre>=1){
if(mp[pre]+1<x) break;
mp[pre]=0;
pre--;
}
if(pre==0) return false;
mp[pre]++;
}
else pre=a[i];
mp.erase(mp.upper_bound(pre),mp.end());
}
return true;
}
signed main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
int l=1,r=INF,ans=0;
while(l<=r){
int mid=(l+r)/2;
if(check(mid)){
ans=mid;
r=mid-1;
}
else l=mid+1;
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;
int n;
int s;
int ans;
void dfs(int i, int sumCount, int sum)
{
if (sum == s && sumCount == n)
{
++ans;
return;
}
if (i == 10 || sumCount == n)
{
return;
}
dfs(i + 1, sumCount + 1, sum + i);
dfs(i + 1, sumCount, sum);
return;
}
int main()
{
while (true)
{
ans = 0;
cin >> n >> s;
if (n == 0 && s == 0) return 0;
dfs(0, 0, 0);
cout << ans << endl;
}
return 0;
}
| 0 | 30,265,439 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,ll>pa;
const int N=2e5+100;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
ll qpow(ll x,ll n)
{
if(x==0&&n==0) return 1;
ll sum=1;
while(n){
if(n&1) {
sum=sum*x%mod;
}
x=x*x%mod;
n>>=1;
}
return sum;
}
ll A[2000010];
ll C(int x,int y)
{
if(y>x) return 0;
if(y<0) return 0;
return A[x]*qpow(A[y],mod-2)%mod*qpow(A[x-y],mod-2)%mod;
}
void init()
{
A[0]=1;
for(int i=1;i<=2e6;i++)
A[i]=A[i-1]*i%mod;
}
int main()
{
init();
int x,y;
cin>>x>>y;
if((x+y)%3!=0) {
cout<<0<<endl;
}
else{
cout<<C((x+y)/3,(2*y-x)/3)<<endl;
}
}
|
#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 rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i > 0; --i)
#define srep(i,s,n) for(int i = s; i < (n); ++i)
#define rsrep(i,s,n) 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 show_pair(...) cout<<#__VA_ARGS__<<" = "<<endl; for (const auto& x : (__VA_ARGS__)) { cout<<" "<<x.fi<<" : "<<x.se<<endl; }
#define out_ary(...) { int n = (__VA_ARGS__).size(); rep(i, n) printf("%d%s", (__VA_ARGS__)[i], i != n-1 ? " " : "\n"); }
#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 pair<int, int> P;
typedef vector<P> vpair;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<string> vstr;
typedef vector<bool> vbool;
typedef vector<vint> vvint;
typedef vector<vll> vvll;
typedef vector<vstr> vvstr;
typedef vector<vbool> vvbool;
const ll LINF = 2000000000000000000ll;
const int INF = 1000000100;
const ll MOD = 1e9+7;
int main() {
int n, k;
cin >> n >> k;
vint a(n);
rep(i, n) cin >> a[i];
vll sum(n+1, 0);
rep(i, n) sum[i+1] = sum[i] + a[i];
vll ls;
rep(i, n) srep(j, i, n) {
ls.push_back(sum[j+1] - sum[i]);
}
for (int i = 40; i >= 0; --i) {
vll ls2;
rep(j, ls.size()) {
if ((1ll << i) & ls[j]) ls2.push_back(ls[j]);
}
if (ls2.size() >= k) {
ls = ls2;
}
}
ll ans = 1;
rep(i, 40) {
ans <<= 1;
ans++;
}
rep(i, ls.size()) {
ans &= ls[i];
}
cout << ans << endl;
return 0;
}
| 0 | 159,358 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,m;
cin>>n>>m;
string s,t;
for(ll i=0;i<n;i++){
s+='0'+m;
}
for(ll i=0;i<m;i++){
t+='0'+n;
}
if(s<t){
cout <<s;
}
else{
cout << t;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll ans = 0;
pair<ll, ll> arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i].first >> arr[i].second;
}
for (int i = n - 1; i >= 0; i--) {
if ((arr[i].first + ans )% arr[i].second == 0)
continue;
else if (arr[i].first + ans > arr[i].second) {
ans += (arr[i].second - ((arr[i].first + ans) % arr[i].second));
} else {
ans += arr[i].second - (arr[i].first + ans);
}
}
cout << ans << endl;
return 0;
}
| 0 | 58,887,516 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010, Mod=1e9+7;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
signed main()
{
int n,m;
n=read(), m=read();
if(m<=2*n) printf("%lld\n",m/2);
else
{
int qwq=m-n*2;
int t=qwq/4;
printf("%lld\n",n+t);
}
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
int main()
{
int n, k;
vector<int> h;
cin >> n >> k;
h.resize(n);
for (int i=0; i<n; i++)
{
cin >> h[i];
}
int count = 0;
for (int i=0; i<n; i++)
{
if(h[i] >= k)
{
count++;
}
}
cout << count << endl;
return 0;
}
| 0 | 23,150,293 |
#include <iostream>
using namespace std;
int main() {
int m,f,r;
cin >> m >> f >> r;
while(m!=-1 || f != -1 || r!= -1) {
string grade;
int score;
score = m+f;
if(m==-1 || f ==-1)
{
grade = "F";
}
else if(score >= 80)
{
grade = "A";
}
else if(score < 80 && score >= 65)
{
grade = "B";
}
else if(score < 65 && score >= 50)
{
grade = "C";
}
else if(score < 50 && score >= 30)
{
if(r>=50)
grade = "C";
else
grade = "D";
}
else
grade = "F";
cout << grade << endl;
cin >> m >> f >> r;
}
}
|
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef double db;
#define ls(x) x<<1
#define rs(x) x<<1|1
#define low(x) (x&-x)
#define all(x) x.begin(),x.end()
#define mp make_pair
#define X first
#define Y second
#ifdef _DEBUG
const int N=1e3+10;
#else
const int N=1e6+10;
#endif
const ll mod=1e9+7;
template<typename T> inline T gcd(T a,T b){return !b?a:gcd(b,a%b);}
template<typename T> inline T q_pow(T a,T x){T ans=1,tmp=a;while(x){if(x&1)(ans*=tmp)%=mod;(tmp*=tmp)%=mod;x>>=1;}return ans;}
template<typename T> inline void re(T &N){int f=1;char c;while((c=getchar())< '0'||c> '9')if(c=='-')f=-1;N=c-'0';while((c=getchar())>='0'&&c<='9')N=N*10+c-'0';N*=f;}
int m,n,t=1,st,en;
int a[N],b[N],d[N];
char s[N];
int main()
{
re(n);
for(int i=1;i<=n;i++)re(a[i]);
int l=0,r=0;ll ans=0;
while(r< n)
{
r++;int ma=-1;
for(int i=0;i<=20;i++)if((a[r]>>i)&1)
{
if(d[i])ma=max(ma,d[i]);
d[i]=r;
}
if(ma>=0)l=max(l,ma);
ans+=r-l;
}
printf("%lld\n",ans);
}
| 0 | 42,838,959 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vint conf(n,0);
vint mount(n,0);
{
int pre=0;
REP(i,n){
int h;
cin >> h;
mount[i]=h;
if(h!=pre){
conf[i]=1;
}
pre=h;
}
}
{
int pre=0;
vint a(n);
REP(i,n)cin >> a[i];
for(int i=n-1;i>=0;--i){
int h = a[i];
if(conf[i]==1){
if(h<mount[i] || (pre!=h&&h!=mount[i])){
cout << 0 << endl;
return 0;
}
}else{
if(h!=pre){
conf[i]=1;
if(h>mount[i]){
cout << 0 << endl;
return 0;
}
mount[i]=h;
}else{
mount[i] = min(mount[i], h);
}
}
pre=h;
}
}
ll ans = 1;
REP(i,n){
if(conf[i]==0){
ans *= (ll)mount[i];
ans = FIX(ans);
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const long long MOD=(long long)(1e9+7);
const int NAX=1005;
const int MAXN=1000005;
Int N,M,K;
Int W,H;
Int X,Y,Z;
vector<Int> A;
int spf[MAXN];
void sieve()
{
spf[1] = 1;
for (int i=2; i<MAXN; i++)
spf[i] = i;
for (int i=4; i<MAXN; i+=2)
spf[i] = 2;
for (int i=3; i*i<MAXN; i++)
{
if (spf[i] == i)
{
for (int j=i*i; j<MAXN; j+=i)
if (spf[j]==j)
spf[j] = i;
}
}
}
Int perform(Int x){
return (x*(x+1))/2LL;
}
Int getFactors(int x){
Int ans=1;
Int temp=x;
while(temp!=1){
int iter=0;
int prime=spf[temp];
while(temp%prime==0){
temp/=prime;
++iter;
}
ans*=(iter+1);
}
return ans;
}
int main()
{
cin>>N;
sieve();
Int counter=0;
for(int i=1;i<N;++i){
counter+=getFactors(i);
}
cout<<counter<<"\n";
}
| 0 | 39,061,956 |
#include<iostream>
using namespace std;
int main() {
while (1) {
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if (m == 0) break;
int ans = 0;
int tmp;
cin >> tmp;
int maxgap = 0;
for (int i = 1; i < m; ++i) {
int s;
cin >> s;
if (maxgap <= tmp - s && i >= nmin && i <= nmax) {
maxgap = tmp - s;
ans = i;
}
tmp = s;
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <bits/stdc++.h>
#include <set>
#define isPowerOfTwo(S) (!(S & (S - 1)))
#define ll long long
#define ull unsigned long long
#define MAXN 1000000007
#define INF 1e12
using namespace std;
typedef pair<int,int> pi;
typedef pair<pi,int> trip;
typedef pair<ll int,ll int> pli;
typedef vector<int> vi;
typedef vector<ll int> vli;
typedef vector<vi> vvi;
string getString(char x)
{
string s(1, x);
return s;
}
int highestPowerof2(ll int n)
{if(n==0)
return 0;
int p = (int)log2(n);
return p;
}
int main()
{ios::sync_with_stdio(0);
cin.tie(0);
int test=1;
vector<int>fact(1e6+1,0);
for(int i=0;i<=1e6;i++)
fact[i]=i;
for(int i=2;i<=1e6;i++)
{
if(fact[i]==i)
{
for(int j=1;j*i<=1e6;j++)
fact[j*i]=i;
}
}
while(test--)
{
int n;
cin>>n;
vi vec(n);
vi f(1e6+1,0);
for(int i=0;i<n;i++)
{cin>>vec[i];
int k=vec[i];
map<int,int>ma;
while(k>1)
{
int p=fact[k];
if(ma[p]==0)
{ma[p]=1;f[p]++;}
k/=p;
}
}
int check=1;
for(int i=0;i<f.size();i++)
{
if(f[i]>1)
{check=0;}
}
if(check)
{
cout<<"pairwise coprime"<<endl;continue;
}
check=1;
for(int i=0;i<f.size();i++)
{
if(f[i]>=n)
{check=0;}
}
if(check)
{
cout<<"setwise coprime"<<endl;continue;
}
cout<<"not coprime"<<endl;
}
}
| 0 | 8,594,488 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int num = N;
int H=0;
while(num){
H += num % 10;
num /= 10;
}
if(N%H==0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int n, a, b, c, x;
while (cin >> n >> a >> b >> c >> x){
if (n == 0) break;
vector <int> reel(n);
for (int i = 0; i < n; i++){
cin >> reel[i];
}
int now = 0, old = x, next = 0;
if (reel[0] == x){
now++;
}
if (n == now){
cout << 0 << endl;
goto END;
}
for (int i = 1; i <= 10000; i++){
next = (a * old + b) % c;
if (reel[now] == next){
now++;
if (now == n){
cout << i << endl;
goto END;
}
}
old = next;
}
cout << "-1" << endl;
END:;
}
return 0;
}
| 0 | 11,405,777 |
#include<algorithm>
#include<string>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<utility>
#include<functional>
#include<cassert>
#include<cmath>
#include<math.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<ll> vint;
typedef vector<vint> vvint;
#define PI 3.1415926535;
#define MOD 1000000007;
vint t;
queue<ll> q;
int main(void) {
ll k;
cin >> k;
t.resize(k, (ll)1e6);
q.push(1);
t[1] = 1;
while (!q.empty()) {
ll x = q.front(); q.pop();
if (t[(x + 1)%k] > t[x] + 1) {
q.push((x + 1)%k);
t[(x + 1)%k] = t[x] + 1;
}
if (t[(x * 10) % k] > t[x]) {
q.push((x * 10) % k);
t[(x * 10) % k] = t[x];
}
}
cout << t[0] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
int main() {
int n;
cin >> n;
vi a(n);
map<int, int> m;
rep(i, n) {
cin >> a[i];
m[a[i]]++;
}
int cnt = 0;
for (auto x : m) {
if (x.first > x.second) {
cnt += x.second;
} else {
cnt += x.second - x.first;
}
}
cout << cnt << endl;
}
| 0 | 37,660,721 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
#define int long long
typedef pair<int,int> P;
typedef pair<int,P> PP;
int dfs(int v,vector<int>& used,const vector<vector<int> >& g,int k){
if(used[v]!=-1){
return k==used[v];
}
used[v]=k;
int res=1;
for(int i=0;i<g[v].size();i++){
if(dfs(g[v][i],used,g,(k+1)%2)==0)res=0;
}
return res;
}
signed main(){
int n,m;
cin>>n>>m;
vector<vector<int> > g(n);
for(int i=0;i<m;i++){
int u,v;
cin>>u>>v;
u--,v--;
g[u].pb(v);
g[v].pb(u);
}
int sum=0;
int ind=0;
for(int i=0;i<n;i++){
if(g[i].size()==0){
ind++;
sum+=n;
}
}
sum+=(n-ind)*ind;
int cn[2]={};
vector<int> used(n,-1);
for(int i=0;i<n;i++){
if(used[i]!=-1||g[i].size()==0)continue;
cn[dfs(i,used,g,0)]++;
}
sum+=cn[1]*cn[1]*2;
sum+=cn[0]*cn[0];
sum+=cn[1]*cn[0];
sum+=cn[0]*cn[1];
cout<<sum<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
int total;
int ave;
while (1) {
int tmp;
vector<int> v;
cin >> n;
if (n == 0)break;
for (int i = 0; i<n; i++) {
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
total = 0;
for (int i = 0; i<n; i++) {
total += v[i];
}
total = total - (v[0] + v[n - 1]);
ave = total / (n - 2);
cout << ave << endl;
}
}
| 0 | 81,703,265 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
using ll=long long;
const int MOD=1e9+7;
const double pi=3.14159265358979323846;
const int inf=1e9+5;
const ll INF=1e18+5;
using P=pair<int,int>;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int main() {
cin.tie(0),cout.tie(0);
ios::sync_with_stdio(false);
int n,l,a[100005]={},x,M=0;
cin >> n >> l;
for(int i=0; i<n; i++) {
cin >> a[i];
}
for(int i=0; i<n-1; i++) {
M=max(M,a[i]+a[i+1]);
if(a[i]+a[i+1]>=l) {
x=i+1;
}
}
if(M<l) {
cout << "Impossible" << "\n";
}
else {
cout << "Possible" << "\n";
for(int i=1; i<x; i++) {
cout << i << "\n";
}
for(int i=n-1; i>=x; i--) {
cout << i << "\n";
}
}
}
|
#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 | 83,139,445 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m, v, p; cin >> n >> m >> v >> p;
vector<int> a(n); cin >> a;
sort(a.rbegin(), a.rend());
int l = p, r = n;
while (l < r) {
int mid = (l + r + 1) / 2;
long long sum = 0;
for (int i = 0; i < n; i++) {
if (i < p - 1 || i >= mid - 1) {
sum += m;
} else {
if (a[i] > a[mid - 1] + m) {
sum = -1;
break;
}
sum += (a[mid - 1] + m) - a[i];
}
}
if (sum >= (long long) m * v) {
l = mid;
} else {
r = mid - 1;
}
}
cout << l << '\n';
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i=0; i < int(n); i++)
using namespace std;
ll MOD7 = 1000000007;
ll MOD9 = 1000000009;
vector<ll> InputVec(ll N){
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
return A;
}
void OutputVec(vector<ll> A){
for (int i = 0; i < A.size(); ++i) {
cout << A[i] << ",";
}
cout << endl;
}
vector<vector<ll>> InputVec2d(ll H,ll W){
vector<vector<ll>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<ll>(W);
}
for (int yi = 0; yi < H; ++yi) {
for (int xi = 0; xi < W; ++xi) {
cin >> A[yi][xi];
}
}
return A;
}
vector<vector<char>> InputVec2dStr(ll H,ll W){
vector<vector<char>> A(H);
for (int yi = 0; yi < H; ++yi) {
A[yi] = vector<char>(W);
}
for (int yi = 0; yi < H; ++yi) {
string S;
cin >> S;
for (int xi = 0; xi < W; ++xi) {
A[yi][xi] = S[xi];
}
}
return A;
}
void OutputVec2d(vector<vector<ll>> A){
for (int yi = 0; yi < A.size(); ++yi) {
for (int xi = 0; xi < A[yi].size(); ++xi) {
cout << A[yi][xi] << ",";
}
cout << endl;
}
}
graph InputGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
return G;
}
graph InputDGraph(ll N,ll M){
graph G(N);
for (int i = 0; i < M; ++i) {
ll a,b;
cin >> a >> b;
a--;b--;
G[a].push_back(b);
}
return G;
}
void OutputGraph(graph G){
for (int i = 0; i < G.size(); ++i) {
cout << i << ":";
for (int j = 0; j < G[i].size(); ++j) {
cout << G[i][j]<< ",";
}
cout << endl;
}
}
void OutputAnswerBool(bool b,bool isUpperCase = false){
if(b){
if(isUpperCase){
cout << "YES" << endl;
}else{
cout << "Yes" << endl;
}
}else{
if(isUpperCase){
cout << "NO" << endl;
}else{
cout << "No" << endl;
}
}
}
int main() {
ll N,M,K;
cin >> N >> M >> K;
for (int yi = 0; yi <= N; ++yi) {
for (int xi = 0; xi <= M; ++xi) {
if(yi * xi + (N-yi)*(M-xi) == K){
cout <<"Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0 | 78,341,663 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,k,n) for(int i=(k);i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define output(x,y) cout << fixed << setprecision(y) << x << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
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; }
const ll MOD = 1e9 + 7;
ll upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
int dx[4] = { 0,-1,0,1 };
int dy[4] = { -1,0,1,0 };
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) {
cin >> s[i];
}
queue<P<int>> que;
VV dist(h, V(w, upper));
rep(i, h) rep(j, w) {
if (s[i][j] == '#') {
que.push(make_pair(i, j));
dist[i][j] = 0;
}
}
while (!que.empty()) {
P<int> p = que.front();
que.pop();
int y = p.first;
int x = p.second;
rep(dir, 4) {
int ny = y + dy[dir];
int nx = x + dx[dir];
if (ny < 0 || ny >= h || nx < 0 || nx >= w) continue;
if (dist[ny][nx] != upper) continue;
dist[ny][nx] = dist[y][x] + 1;
que.push(make_pair(ny, nx));
}
}
int ans = 0;
rep(i, h) rep(j, w) {
chmax(ans, dist[i][j]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=998244353,MAX=3105,INF=1<<30;
char S[MAX][MAX],ans[MAX][MAX];
int main(){
int H,W,D;cin>>H>>W>>D;
string T="RYGB";
for(int i=100;i<=2000;i+=D){
for(int j=100;j<=2000;j+=D){
int c=((i-100)/D)%2*2+((j-100))/D%2;
for(int x=0;x<D;x++){
for(int y=0;y<D;y++){
S[i+x][j+y]=T[c];
}
}
}
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
ans[i][j]=S[i+1000+j][i+1000-j];
}
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cout<<ans[i][j];
}
cout<<endl;
}
}
| 0 | 71,785,518 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
int yes=0;
cin>>n>>k;
int vis[n]={0};
for(i=0;i<k;i++)
{
cin>>j;
for(int x=0;x<j;x++)
{
int p;
cin>>p;
vis[p-1]++;
}
}
ll c=0;
for(i=0;i<n;i++)
{
if(vis[i]==0)
c++;
}
cout<<c;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int i,j,k;
int t;
std::cout.precision(10);
t=1;
while(t--)
{
solve();
cout<<"\n";
}
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <set>
#include <string>
#include <fstream>
#define F first
#define S second
#define ll long long
#define int ll
#define fast() ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define per() cout<<fixed<<setprecision(12)
#define pb push_back
#define FOR(i,a,b) for(int i=a;((a<b)?(i<=b):(i>=b));((a<b)?(i++):(i--)))
using namespace std;
const int MAX_N = 1e2+10;
const int INF = 1e12+10;
const ll mod = 1e18;
ofstream out("output.txt");
ifstream in("intput.txt");
typedef pair<int,int> pii;
int bpow(int t,int n){int ans=1;while(n>0){if(n&1)ans=(ans*t)%mod;t=(t*t)%mod,n>>=1;}return ans;}
int from[MAX_N*100],to[MAX_N*100],w[MAX_N*100];
int n,m;
int d[MAX_N][MAX_N];
bool relax(int e,int s){
if(d[s][to[e]]>d[s][from[e]]+w[e]&&d[s][from[e]]!=INF){
d[s][to[e]]=d[s][from[e]]+w[e];
return true;
}
return false;
}
bool ok=true;
void bellman(int s){
fill(d[s],d[s]+MAX_N,INF);
d[s][s]=0;
for(int i=0;i<n-1;i++)
for(int e=0;e<m;e++)
relax(e,s);
for(int e=0;e<m;e++)
if(relax(e,s))
ok=false;
}
int32_t main(){
fast();per();
cin>>n>>m;
for(int i=0;i<m;i++)
cin>>from[i]>>to[i]>>w[i];
for(int i=0;i<n;i++)
bellman(i);
if(!ok)
return cout<<"NEGATIVE CYCLE\n",0;
for(int v=0;v<n;v++,cout<<'\n')
for(int u=0;u<n;u++){
if(d[v][u]!=INF)
cout<<d[v][u];
else
cout<<"INF";
if(u!=n-1)
cout<<" ";
}
}
| 0 | 12,021,972 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
using vd = vector<double>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
int main() {
ll n;
cin >> n;
vl c(n), s(n), f(n);
rep(i, n - 1) cin >> c[i] >> s[i] >> f[i];
rep(i, n) {
ll ans = 0;
rep2(j, i, n - 1) ans = (max(ans, s[j]) + f[j] - 1) / f[j] * f[j] + c[j];
cout << ans << '\n';
}
}
|
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
vector<int> dy = {1, 0, -1, 0};
vector<int> dx = {0, 1, 0, -1};
typedef pair<int, int> PII;
int main() {
int h, w;
cin >> h >> w;
vector<string> grah(h);
rep(i, h) cin >> grah.at(i);
queue<PII> q;
vector<vector<int>> dist(h, vector<int>(w, -1));
rep(i,h) rep(j, w){
if(grah.at(i).at(j) == '#'){
q.emplace(i, j);
dist.at(i).at(j) = 0;
}
}
while(!q.empty()){
PII v = q.front();
q.pop();
rep(i, 4){
int ny = v.first + dy.at(i);
int nx = v.second + dx.at(i);
if(ny >= 0 && nx >= 0 && ny < h && nx < w && dist.at(ny).at(nx) == -1 && grah.at(ny).at(nx) != '#'){
dist.at(ny).at(nx) = dist.at(v.first).at(v.second) + 1;
q.emplace(ny, nx);
}
}
}
int res = 0;
rep(i, h) rep(j, w){
res = max(res, dist.at(i).at(j));
}
cout << res << endl;
return 0;
}
| 0 | 66,872,774 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
using ll=long long;
using ld=long double;
typedef pair<double,int> P;
#define repl(i,n) for(ll i=0;i<(n);++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define INF 100000000
int main()
{
int h,n;
cin >> h >> n;
vector<int> a(n),b(n);
vector<vector<int>> dp(n+1,vector<int>(h+1));
rep(i,n)cin >> a[i] >> b[i];
rep(i,n+1)dp[i][0]=0;
rep(i,h+1)dp[0][i]=INF;
rep(i,n){
rep(j,h){
if(a[i]>j+1){
dp[i+1][j+1]=min(dp[i][j+1],dp[i+1][0]+b[i]);
}else{
dp[i+1][j+1]=min(dp[i][j+1],dp[i+1][j+1-a[i]]+b[i]);
}
}
}
cout << dp[n][h] << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
string s;
cin>>s;
int ans=0;
rep(i,10)rep(j,10)rep(k,10){
int z=0;
rep(a,n){
if(z==0&&s[a]-'0'==i) z=1;
else if(z==1&&s[a]-'0'==j) z=2;
else if(z==2&&s[a]-'0'==k) z=3;
}
if(z==3) ans++;
}
cout<<ans;
}
| 0 | 47,529,860 |
#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int S;
cin >> S;
map<int, int> list;
list[S]++;
while (true)
{
int tmp;
if (S % 2 == 0)
tmp = S /= 2;
else
tmp = S * 3 + 1;
if (list.find(tmp) == list.end())
list[tmp]++;
else
{
cout << list.size() + 1;
break;
}
S = tmp;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
string s;
cin >> s;
bool x=true;
int i=0;
while(i<s.size()) {
if(s.size()-i<5){
cout << "NO" << endl;
return 0;
}
if(s[i]=='d' && s[i+1]=='r' && s[i+2]=='e' && s[i+3]=='a' && s[i+4]=='m'){
if(s.size()>i+6){
if(s[i+5]=='d'){
i += 5;
}
else if(s[i+5]=='e' && s[i+6]=='r'){
if(s.size()>i+7){
if(s[i+7]=='d'||s[i+7]=='e') i+=7;
else if(s[i+7]=='a') i += 5;
else {
x=false;
break;
}
}
else break;
}
else {
x=false;
break;
}
}
else break;
}
else if(s[i]=='e' && s[i+1]=='r' && s[i+2]=='a' && s[i+3]=='s' && s[i+4]=='e'){
if(s.size()>i+5){
if(s[i+5]=='d') i+=5;
else if(s[i+5]=='r') i+=6;
else if(s[i+5]=='e') i+= 5;
else {
x=false;
break;
}
}
else break;
}
else {
x=false;
break;
}
}
if(x==false) cout << "NO" << endl;
else cout << "YES" << endl;
return 0;
}
| 0 | 69,871,504 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<pair<string, int>> v(n);
for(auto &x:v) cin >> x.first >> x.second;
string p; cin >> p;
bool found = false; int ans = 0;
for(int i=0;i<n;i++){
if(v[i].first == p){
found = true;
continue;
}
if(found) ans += v[i].second;
}
cout << ans << "\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
const int MAX=1000000;
ll m[MAX+10];
string multiply(string num1, string num2)
{
int len1 = num1.size();
int len2 = num2.size();
if (len1 == 0 || len2 == 0)
return "0";
vector<int> result(len1 + len2, 0);
int i_n1 = 0;
int i_n2 = 0;
for (int i=len1-1; i>=0; i--)
{
int carry = 0;
int n1 = num1[i] - '0';
i_n2 = 0;
for (int j=len2-1; j>=0; j--)
{
int n2 = num2[j] - '0';
int sum = n1*n2 + result[i_n1 + i_n2] + carry;
carry = sum/10;
result[i_n1 + i_n2] = sum % 10;
i_n2++;
}
if (carry > 0)
result[i_n1 + i_n2] += carry;
i_n1++;
}
int i = result.size() - 1;
while (i>=0 && result[i] == 0)
i--;
if (i == -1)
return "0";
string s = "";
while (i >= 0)
s += std::to_string(result[i--]);
return s;
}
int main()
{
ll n;
cin>>n;
bool f=true;
string str1,s ;
cin>>str1;
for(ll i=0;i<n-1;i++)
{
string str2 ;
cin>>str2;
if(str2[0]=='0')
{
cout<<0<<endl;
return 0;
}
if(f)
{
s=multiply(str1, str2);
if(s.size()>19)
{
f=false;
}else if(s.size()==19)
{
if(s[0]!='1')
{
f=false;
}else {
for(ll j=1;s[j];j++)
{
if(s[j]!='0')
{
f=false;
}
}
}
}
str1=s;
}
}
if(f)cout<<s<<endl;
else cout<<-1<<endl;
return 0;
}
| 0 | 60,182,936 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (Int i = s; i < (Int)(n); i++)
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
double EPS = 1e-10;
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;
int main() {
Int n;
cin >> n;
string s;
cin >> s;
map<char, Int> mp;
rep(i, 0, n) mp[s[i]]++;
Int res = 1;
for (auto i : mp) {
res *= i.se + 1;
res %= mod;
}
dump(res - 1);
return 0;
}
|
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
const int MOD = 1e9+7;
int levenshtein(string s, string t){
int lenS = s.length();
int lenT = t.length();
vector<vector<int>> dp(lenS+1, vector<int>(lenT+1));
rep(i, lenS+1){
dp[i][0] = i;
}
rep(i, lenT+1){
dp[0][i] = i;
}
rep(i, lenS){
rep(j, lenT){
dp[i+1][j+1] = min(dp[i+1][j]+1, dp[i][j+1]+1);
int c = s[i] == t[j] ? 0 : 1;
dp[i+1][j+1] = min(dp[i+1][j+1], dp[i][j] + c);
}
}
return dp[lenS][lenT];
}
signed main(){
string s1, s2;
cin >> s1 >> s2;
cout << levenshtein(s1, s2) << endl;
return 0;
}
| 0 | 11,831,493 |
#include <iostream>
#include <cmath>
#include <stdio.h>
using namespace std;
int main() {
int a, b;
double degree;
cin >> a >> b >> degree;
double rad = M_PI*(degree/180);
double s = a*b*sin(rad)/2;
printf("%.5lf\n", s);
double c = a*a + b*b - 2*a*b*cos(rad);
c = sqrt(c);
printf("%.5lf\n", a+b+c);
printf("%.5lf\n", s*2/a);
return 0;
}
|
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
typedef complex<double> P;
void solve() {
int N;
cin >> N;
vi X(N), Y(N);
vector<P> ps(N);
rep(i, N) {
cin >> X[i] >> Y[i];
ps[i] = P(X[i], Y[i]);
}
sort(all(ps), [&](P p, P q) {
return atan2(imag(p), real(p)) < atan2(imag(q), real(q));
});
double ans = 0;
rep(i, N) {
double x = 0, y = 0;
rep(j, N) {
x += real(ps[(i + j) % N]);
y += imag(ps[(i + j) % N]);
smax(ans, sqrt(x*x + y * y));
}
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
}
| 0 | 31,207,955 |
#include <bits/stdc++.h>
using namespace std;
const int N = 8005;
int n, x, y, vv[2 * N], *v, c, d;
char s[N];
vector<int> xv, yv;
int main(){
v = vv + N;
scanf("%s%d%d", s, &x, &y);
n = strlen(s);
int i = 0;
for(; i < n; i++, x--) if(s[i] == 'T') break;
xv.push_back(0);
yv.push_back(0);
for(int j; i < n; i = j){
for(j = i + 1; j < n; j++) if(s[i] != s[j]) break;
if(s[i] == 'T') d ^= (j - i) % 2;
else{
vector<int> nv, &cv = (d ? yv : xv);
for(int k : cv){
if(v[k - (j - i)] != i) nv.push_back(k - (j - i));
if(v[k + (j - i)] != i) nv.push_back(k + (j - i));
v[k - (j - i)] = v[k + (j - i)] = i;
}
cv = nv;
}
}
puts(count(xv.begin(), xv.end(), x) && count(yv.begin(), yv.end(), y) ? "Yes" : "No");
}
|
#include<iostream>
using namespace std;
int main(){
int coin[]={500,100,50,10,5,1};
int n;
int i;
int result;
cin >> n;
while(n){
n = 1000 - n;
i = 0;
result = 0;
while(n){
if(n - coin[i] >= 0){
n -= coin[i];
result++;
}else{
i++;
if(i > 6){
break;
}
}
}
cout << result << endl;
cin >> n;
}
}
| 0 | 83,683,173 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
int t,b;
t=min(A,B);
b=min(C,D);
int ans=t+b;
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long N, K;
string S;
long long pow(long long N, long long K) {
long long res = 1;
for (int i = 0; i < K; i++)
{
res *= N;
}
return res;
}
long long com(long long N, long long R) {
if(N < R || R < 0) return 0;
if(R == 1) return N;
else if(R == 2) return N * (N-1) / 2;
else return N * (N-1) * (N-2) / 6;
}
long long solve(int i, int k, int smaller) {
if(i == N) {
if(k == 0) return 1;
else return 0;
}
if(k == 0) return 1;
if(smaller) return com(N-i, k) * pow(9, k);
else {
if(S[i] == '0') return solve(i+1, k, false);
else {
long long zero = solve(i+1, k, true);
long long aida = solve(i+1, k-1, true) * (S[i] - '1');
long long icchi = solve(i+1, k-1, false);
return zero + aida + icchi;
}
}
}
int main() {
cin >> S >> K;
N = S.size();
cout << solve(0, K, false) << endl;
return 0;
}
| 0 | 12,550,231 |
#include<bits/stdc++.h>
using namespace std;
int N;
int main() {
cin >> N;
cout << N*N << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define LL long long
const int MOD = 1E9+7;
const int N = 100000+5;
const int dx[] = {0,0,-1,1,-1,-1,1,1};
const int dy[] = {-1,1,0,0,-1,1,-1,1};
using namespace std;
char str[N];
int res[N];
void cal(int i){
if(str[i]=='o'&&res[i]==0){
res[i+1]=res[i-1];
}
else if(str[i]=='o'&&res[i]==1){
res[i+1]=!res[i-1];
}
else if(str[i]=='x'&&res[i]==0){
res[i+1]=!res[i-1];
}
else if(str[i]=='x'&&res[i]==1){
res[i+1]=res[i-1];
}
}
int main(){
int n;
scanf("%d",&n);
scanf("%s",str+1);
int endd;
bool flag=false;
res[1]=0;res[2]=0;
if(str[1]=='o')
endd=0;
else
endd=1;
for(int i=2;i<=n;i++)
cal(i);
if(res[n]==endd&&res[1]==res[n+1])
flag=true;
if(!flag){
res[1]=0;res[2]=1;
if(str[1]=='o')
endd=1;
else
endd=0;
for(int i=2;i<=n;i++)
cal(i);
if(res[n]==endd&&res[1]==res[n+1])
flag=true;
}
if(!flag){
res[1]=1;res[2]=0;
if(str[1]=='o')
endd=1;
else
endd=0;
for(int i=2;i<=n;i++)
cal(i);
if(res[n]==endd&&res[1]==res[n+1])
flag=true;
}
if(!flag){
res[1]=1;res[2]=1;
if(str[1]=='o')
endd=0;
else
endd=1;
for(int i=2;i<=n;i++)
cal(i);
if(res[n]==endd&&res[1]==res[n+1])
flag=true;
}
if(!flag)
printf("-1\n");
else{
for(int i=1;i<=n;i++){
if(res[i]==0)
printf("S");
else
printf("W");
}
printf("\n");
}
return 0;
}
| 0 | 61,330,519 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) cerr << #v << ":"; rep(i, v.size()) cerr << " " << v[i]; cerr<<endl
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;
void solve() {
string s, t;
cin >> s >> t;
int cnt = 0;
rep(i, s.size()) {
if (s[i] != t[i]) cnt++;
}
cout << cnt << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
string s;
cin >> s;
int a=s[0]-'0',b=s[1]-'0',c=s[2]-'0',d=s[3]-'0';
int ans=0;
for(int i=0;i<(1<<3);i++){
int sum=a;
if((1<<2)&i)sum+=b;
else sum-=b;
if((1<<1)&i)sum+=c;
else sum-=c;
if((1<<0)&i)sum+=d;
else sum-=d;
if(sum==7){
ans=i;
break;
}
}
string exp="";
exp+=a+'0';
if((1<<2)&ans)exp+="+";
else exp+="-";
exp+=b+'0';
if((1<<1)&ans)exp+="+";
else exp+="-";
exp+=c+'0';
if((1<<0)&ans)exp+="+";
else exp+="-";
exp+=d+'0';
exp+="=7";
cout << exp << endl;
return 0;
}
| 0 | 42,426,212 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double EPS = 1e-10;
int main(void) {
string S;
cin >> S;
reverse(S.begin(), S.end());
ll ans = 0;
ll count = 0;
for (int i = 0; i < S.length(); ++i) {
if (S[i] == 'W') {
count++;
} else {
ans += count;
}
}
cout << ans << endl;
return 0;
}
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vector<int>;
using vll=vector<ll>;
template<class T>using arr=vector<vector<T>>;
template<class T>int popcount(T &a){int c=0; rep(i, 8*(int)sizeof(a)){if((a>>i)&1) c++;} return c;}
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} pr(a[a.size()-1]);}
template<class T>void prarr(arr<T>& a){rep(i, a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main()
{
int n; cin >> n;
vll a(n), b(n), c(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) c[i] = a[i] - b[i];
ll asum = 0, bsum = 0;
rep(i, n) asum += a[i];
rep(i, n) bsum += b[i];
if(asum < bsum) {pr(-1); return 0;}
ll small_sum=0, small_cnt=0;
rep(i, n) if(b[i] > a[i]) {small_sum += b[i] - a[i]; small_cnt++;}
if(small_cnt==0) {pr(0); return 0;}
sort(c.rbegin(), c.rend());
ll large_sum=0;
int ans = 0;
rep(i, n){
large_sum += c[i];
if(large_sum >= small_sum){
ans = i+1;
break;
}
}
pr(ans+small_cnt);
return 0;}
| 0 | 23,791,288 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long ,long b){
if (a % b == 0) return b;
return gcd(b, a % b);
}
long long lcm(long long a, long long b){
return (a / gcd(a,b) ) * b;
}
int main(void){
int n;
cin >> n;
vector<long long> t(n);
for (int i = 0; i < n; i++) cin >> t[i];
long long ans = t[0];
for (int i = 0; i < n; i++) ans = lcm(ans,t[i]);
cout << ans << endl;
}
|
#define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;
const ll MOD = 1000000007;
const long long BIG = 1446803456761533460;
const int Big = 336860180;
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debugp(x) cout << #x << " -> " << "(" << (x).F << ", " << (x).S << ")" << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugap(x, n) cout << #x << " ->\n"; fori (i1_dap, n) { cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
#define debugav(x, n) cout << #x << " ->\n"; fori (i1_dav, n) { fori (i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } cout << '\n'; } cout << endl
#define debugia(x, n) cout << #x << " ->\n"; fori (i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } cout << endl
#define forifrom(i, s, n) for(ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for(ll i = (n) - 1; i >= (e); --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))
#define Add(a, b) a = (a + (b)) % MOD
#define Mul(a, b) a = (a * (b)) % MOD
stringstream sss;
const ll maxn = 100010;
ll n, L;
ll A[maxn];
void MAIN() {
cin >> n >> L;
fori (i, n) cin >> A[i];
ll g = -1;
fori (i, n - 1) if (A[i] + A[i + 1] >= L) g = i;
if (g == -1) {
cout << "Impossible\n";
} else {
cout << "Possible\n";
fori (i, g) cout << i + 1 << '\n';
forirto (i, n - 1, g) cout << i + 1 << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(10);
sss << R"(
5 50
10 20 30 40 50
)";
MAIN();
return 0;
}
| 0 | 86,755,492 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> A(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) cin >> A[i][j];
}
int cnt = 0;
for (int i; i < N; i++) {
for (int j = i + 1; j < N; j++) {
int total = 0;
for (int k = 0; k < D; k++) {
int tmp = pow(A[i][k] - A[j][k], 2);
total += tmp;
}
if(ceil(sqrt(total)) == floor(sqrt(total))) cnt++;
}
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (2e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int n, z, w;
cin >> n >> z >> w;
vi a(n);
rep(i, n) cin >> a[i];
if (n==1) cout << abs(a[0]-w) << endl;
else cout << max(abs(a[n-1]-w), abs(a[n-2]-a[n-1])) << endl;
return 0;
}
| 0 | 78,081,457 |
#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;
const long long MOD = 1e9 + 7;
int main()
{
string L;
cin >> L;
int N = (int)L.size();
vector<vector<ll>> dp(N + 1, vector<ll>(2, 0));
dp[0][0] = 1;
rep(i, N) {
int n = L[i] - '0';
rep(j, 2) {
for (int d = 0; d <= (j ? 1 : n); d++) {
int k = (d ? 2 : 1);
dp[i + 1][j || (d < n)] += dp[i][j] * k;
dp[i + 1][j] %= MOD;
}
}
}
cout << (dp[N][0] + dp[N][1]) % MOD << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, int>
#define mp(a, b) make_pair((a), (b))
#define Flush fflush(stdout)
using namespace std;
const int N = 100050;
const int inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
clock_t TIME_START, TIME_END;
void program_end()
{
#ifdef ONLINE
printf("\nTime used: %.6lf(s)\n", ((double)TIME_END - TIME_START) / CLOCKS_PER_SEC);
system("pause");
#endif
}
ll n, k;
ll ans;
ll f[N];
inline ll mi(ll a, ll b)
{
ll ret = 1;
a %= mod;
while (b)
{
if (b & 1)
ret *= a, ret %= mod;
a *= a, a %= mod;
b >>= 1;
}
return ret;
}
void solve()
{
scanf("%lld%lld", &n, &k);
for (ll i = k; i; --i)
{
f[i] = mi(k / i, n);
for (ll j = i * 2; j <= k; j += i)
f[i] -= f[j];
ans += ((i * f[i] + mod) % mod) % mod;
ans = (ans + mod) % mod;
}
cout << ans << '\n';
}
int main()
{
TIME_START = clock();
int Test = 1;
while (Test--)
solve();
TIME_END = clock();
program_end();
return 0;
}
| 0 | 66,072,878 |
#include <bits/stdc++.h>
#define fail return (cout << -1 << endl), 0
#define ll long long
using namespace std;
int n;
map<ll, int> f;
ll dis[100010], rdis[100010];
int sz[100010];
struct Edge {
int to, next;
}es[200010];
int first[100010], te = 0;
void addE(int a, int b)
{
te++;
es[te].to = b;
es[te].next = first[a];
first[a] = te;
}
void dfs(int p, int fa)
{
if (p != 1) rdis[p] = rdis[fa] + 1;
for (int e = first[p]; e; e = es[e].next)
{
int to = es[e].to;
if (to == fa) continue;
dfs(to, p);
}
}
int main()
{
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> dis[i];
f[dis[i]] = i;
sz[i] = 1;
}
int cnt = 0;
for (map<ll, int>::reverse_iterator it = f.rbegin(); it != f.rend(); it++)
{
int v = it->second, u = f[it->first + 2 * sz[v] - n];
if (!u || u == v) fail;
addE(u, v); addE(v, u);
sz[u] += sz[v];
if (++cnt == n - 1) break;
}
dfs(1, 0);
ll sum = 0;
for (int i = 1; i <= n; i++)
sum += rdis[i];
if (sum != dis[1]) fail;
for (int i = 1; i <= n; i++)
for (int e = first[i]; e; e = es[e].next)
{
if (e & 1) continue;
cout << i << ' ' << es[e].to << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll N, c = 0;
string s;
ll R = 0, G = 0, B = 0;
cin >> N >> s;
for (int i = 0; i < N; i++) {
switch (s[i]) {
case 'R':
R++;
break;
case 'G':
G++;
break;
case 'B':
B++;
break;
}
}
ll i, j, k;
for (ll diff = 1; diff <= N / 2; diff++) {
for (i = 0; i < N; i++) {
j = i + diff;
k = j + diff;
if (k < N) {
if (s[i] != s[k] && s[j] != s[k] && s[i] != s[j]) c--;
} else {
break;
}
}
}
c += R * G * B;
cout << c << endl;
}
| 0 | 77,872,069 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e2+5 , M = 1e5+5 , MOD = 1e9+7;;
int n , k;
ll A[N] , sum[N] , bit[N][M] , dp[N][M];
void add(int x , int y , int val){
for(int i = y ; i < M ; i+=i&-i) bit[x][i] = (bit[x][i]+val)%MOD;
}
ll query(int x , int y){
ll r = 0;
for(int i = y ; i > 0 ; i-=i&-i) r = (r+bit[x][i])%MOD;
return r;
}
int main(){
ios_base::sync_with_stdio(0),cin.tie(0);
cin >> n >> k;
for(int i = 1 ; i <= n ; i++){cin >> A[i]; sum[i] = (sum[i-1]+A[i])%MOD;}
for(int i = 0 ; i <= n ; i++) dp[i][0] = 1;
for(int i = 1 ; i <= n ; i++)
for(int j = 1 ; j <= min(sum[i],(ll)k) ; j++){
dp[i][j] = ((query(i-1,j)-query(i-1,max((ll)0,j-A[i]-1))+MOD)%MOD + (A[i] >= j))%MOD;
add(i,j,dp[i][j]);
}
cout << dp[n][k] << "\n";
}
|
#include<bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
#define int long long
typedef pair<int,int>pi;
typedef vector<int>vi;
const int MAXN=100005;
const int MOD=1000000007;
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define DEC(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp make_pair
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
#define db(x) cerr<<#x<<" = "<<x<<"\n"
#define LOW(v,x) (lower_bound(all(v),(x))-(v).begin())
#define UP(v,x) (upper_bound(all(v),(x))-(v).begin())
int N,A[MAXN];
main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>N;
FOR(i,1,N) cin>>A[i];
int cash = 1000;
int stocks = 0;
if (A[1] < A[2]){
stocks = cash/A[1];
cash -= stocks * A[1];
}
FOR(i,2,N){
cash += stocks * A[i];
stocks = 0;
if (i<N && A[i] < A[i+1]){
stocks = cash/A[i];
cash -= stocks * A[i];
}
}
cout<<cash;
}
| 0 | 55,572,713 |
#include <iostream>
#include <stack>
int main(){
std::stack<int> garage;
int vehicle_num;
while(std::cin >> vehicle_num){
if(vehicle_num != 0) garage.push(vehicle_num);
else{
std::cout << garage.top() << std::endl;
garage.pop();
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
bool ok(ll x){
ll cnt=0;
for(ll i=1;i*i<=x;i++){
if(x%i==0){
cnt+=2;
if(i==x/i) cnt--;
}
}
if(cnt==8){
return true;
}
else {
return false;
}
}
int main() {
ll n;
cin >> n;
ll ans=0;
for(ll i=1;i<=n;i++){
if(i%2==0) continue;
if(ok(i)) ans++;
}
cout << ans << endl;
}
| 0 | 84,558,093 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define era(t) t.erase(unique(be(t)),t.end())
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
typedef long long ll;
using namespace std;
const ll mod=1000000007,mod9=1000000009;
template <class T>inline T lcm(T a,T b){return (a*b/__gcd(a,b));}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n,x;
cin>>n>>x;
cout << 3*(n-__gcd(n,x))<<endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
template<class T> inline bool chmax(T& a, T b) { if(a < b){ a=b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if(a > b){ a=b; return 1; } return 0;}
ll gcd(ll a, ll b){
if(b==0) return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b){
return a * b / gcd(a, b);
}
int main(){
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll U = b-a+1;
ll cdiv = b/c - (a-1)/c;
ll ddiv = b/d - (a-1)/d;
ll cd_lcm = lcm(c,d);
ll candd = b/(cd_lcm) - (a-1)/(cd_lcm);
ll ans = U - (cdiv+ddiv-candd);
cout << ans << endl;
return 0;
}
| 0 | 16,465,525 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n,t;
cin>>n>>t;
long long ans=0;
int now=0,pre=0;
cin>>now;
for(int i=0;i<n-1;i++){
pre=now;
cin>>now;
ans+=min(t,now-pre);
}
cout<<ans+t<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main()
{
int n;cin>>n;
for(int i=0;i<n;++i){
double abdx,abdy,cddx,cddy;
double x[4];
double y[4];
for(int j=0;j<4;++j){
cin>>x[j]>>y[j];
}
abdx=x[0]-x[1];
cddx=x[2]-x[3];
abdy=y[0]-y[1];
cddy=y[2]-y[3];
if(abdy/abdx==cddy/cddx)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
}
| 0 | 23,121,690 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define int long long
int patty[55];
int total[55];
int dfs(int n, int x) {
if(n == 0) {
if(x <= 0) return 0;
else return 1;
}
int res = 0;
if(x <= total[n - 1] + 1LL) {
res += dfs(n - 1,x - 1);
} else {
res += patty[n - 1] + 1LL + dfs(n - 1, x - total[n - 1] - 2);
}
return res;
}
signed main() {
int n,x;
cin >> n >> x;
patty[0] = total[0] = 1LL;
for (int i = 1; i <= n + 1; i++) {
patty[i] = patty[i - 1] * 2LL + 1LL;
total[i] = total[i - 1] * 2LL + 2LL + 1LL;
}
int answer = dfs(n, x);
cout << answer << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
#define mp make_pair
#define f first
#define s second
#define pb push_back
const int N = 3e5 + 5;
const int M = 5e5 + 5;
const int OO = 1e9;
const int mod = 1e9 + 7;
int t,n,a[N],freq[N],cum[N];
void init() {
}
bool f(int m, int k) {
if(m==n) return 0;
return cum[m]/(m-n+k) >= freq[m+1];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
freq[a[i]]++;
}
sort(freq+1, freq+1+n);
for (int i = 1; i <= n; ++i) {
cum[i] = cum[i-1] + freq[i];
}
for (int k = 1; k <= n; ++k) {
int s = n-k+1, e = n;
while (s<e) {
int m = (s+e)/2;
if(f(m, k)) {
s = m + 1;
} else {
e = m;
}
}
cout << cum[e]/(e-(n-k)) << '\n';
}
return 0;
}
| 0 | 64,796,140 |
#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(){
ll x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<ll> p(a), q(b), r(c);
rep(i,a) cin >> p[i];
rep(i,b) cin >> q[i];
rep(i,c) cin >> r[i];
sort(p.rbegin(),p.rend());
sort(q.rbegin(),q.rend());
sort(r.rbegin(),r.rend());
vector<ll> px(x), qy(y);
rep(i,x) px[i] = p[i];
rep(i,y) qy[i] = q[i];
ll ans = 0;
int cnta=0, cntb=0, cntc=0;
rep(i,x+y){
if(px[cnta] >= qy[cntb] && px[cnta] >= r[cntc]){
ans += px[cnta];
cnta++;
}
else if(qy[cntb] >= px[cnta] && qy[cntb] >= r[cntc]){
ans += qy[cntb];
cntb++;
}
else {
ans += r[cntc];
cntc++;
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
int n, m;
while(1) {
cin >> n;
if(n == 0) break;
char ch[26], CH[26];
char num[10];
rep(i,26) {
ch[i] = (char)('a' + i);
CH[i] = (char)('A' + i);
}
rep(i,10) {
num[i] = (char)('0' + i);
}
char c, nc;
rep(i,n) {
cin >> c >> nc;
if(islower(c)) {
ch[c - 'a'] = nc;
} else if(isupper(c)) {
CH[c - 'A'] = nc;
} else {
num[c - '0'] = nc;
}
}
cin >> m;
rep(i,m) {
cin >> c;
if(islower(c)) {
cout << ch[c - 'a'];
} else if(isupper(c)) {
cout << CH[c - 'A'];
} else {
cout << num[c - '0'];
}
}
cout << endl;
}
return 0;
}
| 0 | 24,368,734 |
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
const int INF=1e9;
const long long LINF=1e18;
#define int long long
template <typename T>
void fin(T a){
cout<<a<<endl;
exit(0);
}
signed main(){
int N,A,B;cin>>N>>A>>B;
if(A*B<N)fin(-1);
if(A+B>N+1)fin(-1);
std::vector<int> ans(N);
for(int i=0;i<A;i++)ans[i]=N-A+1+i;
int res=N-(A+B-1);
int now=A,mx=N-A;
for(int i=1;i<B;i++){
int p=min(res,A-1);
for(int j=0;j<=p;j++)ans[now+j]=mx-p+j;
mx-=p+1;now+=p+1;res-=p;
}
for(int i=0;i<N;i++)cout<<ans[i]<<" ";cout<<endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long li;
li n;
vector<vector<li>> g;
li grundy(li pos, li parent) {
li res = 0;
for (li next : g[pos]) {
if (next == parent) {
continue;
}
res ^= grundy(next, pos) + 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
g = vector<vector<li>>(n);
for (int i = 0; i < n - 1; ++i) {
li x, y;
cin >> x >> y;
x--; y--;
g[x].push_back(y);
g[y].push_back(x);
}
cout << (grundy(0, -1) == 0 ? "Bob" : "Alice") << endl;
return 0;
}
| 0 | 99,045,592 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << 1110-n << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define strall(v) (v).cbegin(),(v).cend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
vector<int> cost(n+1,0);
cost[0] = abs(a[0]);
ll total = cost[0];
for(int i=1;i<n;i++) {
cost[i] = abs(a[i] - a[(i-1)]);
total += (cost[i] + 0LL);
}
cost[n] = abs(a[n-1]);
total += abs(a[n-1]);
rep(i,n) {
ll tmp = total,ans = 0;
if(i==0) {
tmp-=(cost[0]+cost[1]);
ans = tmp + abs(a[i+1]);
cout << ans << endl;
continue;
}else if(i == n-1){
tmp-=(cost[i]+cost[i+1]);
ans = tmp + abs(a[i-1]);
cout << ans << endl;
continue;
}
tmp-=(cost[i]+cost[i+1]);
tmp+=abs(a[i+1] - a[i-1]);
cout << tmp << endl;
}
}
| 0 | 15,772,629 |
#include<iostream>
#include<algorithm>
#define MAX_X 1000
#define MAX_Y 1000
using namespace std;
int c[MAX_X+1][MAX_Y+1];
int lcs(string& a, string& b) {
a = ' ' + a;
b = ' ' + b;
for(int i=0; i<a.length(); i++) {
c[i][0] = 0;
}
for(int i=0; i<b.length(); i++) {
c[0][i] = 0;
}
for(int i=1; i<a.length(); i++) {
for(int j=1; j<b.length(); j++) {
if(a[i] == b[j]) {
c[i][j] = c[i-1][j-1] + 1;
} else {
c[i][j] = max(c[i][j-1], c[i-1][j]);
}
}
}
return c[a.length()-1][b.length()-1];
}
int main() {
int n;
string a, b;
cin >> n;
for(int i=0; i<n; i++) {
cin >> a >> b;
cout << lcs(a, b) << endl;
}
}
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j,k
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define sort(a) sort(a.begin(),a.end())
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define sizeoof(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll ans=0;llfor;
int main(){
ll n,m;sc(n);sc(m);
if(n<m)puts("0");
else puts("10");
return 0;}
| 0 | 27,708,433 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
namespace output {
void pr(int x) { cout << x; }
void pr(long x) { cout << x; }
void pr(ll x) { cout << x; }
void pr(unsigned x) { cout << x; }
void pr(unsigned long x) { cout << x; }
void pr(unsigned long long x) { cout << x; }
void pr(float x) { cout << x; }
void pr(double x) { cout << x; }
void pr(ld x) { cout << x; }
void pr(char x) { cout << x; }
void pr(const char* x) { cout << x; }
void pr(const string& x) { cout << x; }
void pr(bool x) { pr(x ? "true" : "false"); }
template<class T> void pr(const complex<T>& x) { cout << x; }
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T> void pr(const T& x);
template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
pr(t); pr(ts...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void pr(const T& x) {
pr("{");
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
void print() { pr("\n"); }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) {
pr(t); if (sizeof...(ts)) pr(" "); print(ts...);
}
}
using namespace output;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll Q, H, S, D; cin >> D >> S >> H >> Q;
ll N; cin >> N;
if (2 * D < S) S = 2 * D;
if (2 * S < H) H = 2 * S;
if (2 * H < Q) Q = 2 * H;
ll ans = 0;
ans += (N / 2) * Q;
ans += (N % 2) * H;
print(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(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 n;
cin >> n;
vector<ll> a(n+1), b(n);
rep1(i, n+1) cin >> a[i];
rep1(i, n) cin >> b[i];
ll ans = 0, cnt = 0;
rep1(i, n){
ans += min(a[i], b[i]);
b[i] -= a[i];
if (b[i] < 0) b[i] = 0;
ans += min(a[i+1], b[i]);
a[i+1] -= b[i];
if (a[i+1] < 0) a[i+1] = 0;
}
cout << ans << endl;
}
| 0 | 56,944,221 |
#include<bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
long long N, M;
long long WC[100005];
bool AC[100005];
int main(){
cin >> N >> M;
long long ac = 0;
long long wc = 0;
rep(i, M) {
long long num;
string res;
cin >> num >> res;
if(res == "WA") {
if(!AC[num]) {
WC[num]++;
}
} else {
if(!AC[num]) {
ac++;
AC[num] = true;
}
}
}
rep(i, N+2) {
if(AC[i]) wc += WC[i];
}
cout << ac << " " << wc << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define DEBUG_MODE
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(...) debug_func_mult(split_names(#__VA_ARGS__), __VA_ARGS__)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(...) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define DEBUG_ENDL_S(S) ((S).size() ? "\n" : "") << flush;
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using PLL = P<ll, ll>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename Head, typename... Tail> const Head& var_min(const Head &head, const Tail&... tail) { return min(head, var_min(tail...)); }
template <typename Head, typename... Tail> const Head& var_max(const Head &head, const Tail&... tail) { return max(head, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
string to_string(const string &s) { return s; }
template <typename T, typename U>
string to_string(const P<T, U> &p) {
string ret = "(";
ret += to_string(p.first);
ret += ", ";
ret += to_string(p.second);
ret += ")";
return move(ret);
}
template <typename T>
string to_string(const V<T> &v) {
string ret = "{";
for(const T &t : v) {
ret += to_string(t);
ret += ", ";
}
ret += "}";
return move(ret);
}
template <typename T>
void debug_func(const T &t, const string &s = "") {
if(s.size()) cout << s << " = ";
cout << to_string(t) << DEBUG_ENDL_S(s);
}
template <typename T>
void debug_func_mult(int idx, const V<string> &names, const T &t) {
debug_func(t, names[idx]);
}
template <typename T>
void debug_func_mult(const V<string> &names, const T &t) {
debug_func(t, names[0]);
}
template <typename Head, typename... Tail>
void debug_func_mult(int idx, const V<string> &names, const Head &head, const Tail&... args) {
debug_func(head, names[idx]);
debug_func_mult(idx + 1, names, args...);
}
template <typename Head, typename... Tail>
void debug_func_mult(const V<string> &names, const Head &head, const Tail&... args) {
debug_func(head, names[0]);
debug_func_mult(1, names, args...);
}
V<string> split_names(string &&s) {
replace(ALL(s), ' ', ',');
V<string> ret;
istringstream ss(s);
string t;
while(getline(ss, t, ',')) if(t.size()) ret.push_back(move(t));
return move(ret);
}
void init_io() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(30);
}
int main() {
init_io();
ll N;
cin >> N;
V<ll> A(N);
ll ans = 0;
ll maxv = 0;
for(ll i = 0; i < N; i++) {
ll e;
cin >> e;
if(e == maxv + 1) {
maxv++;
continue;
}
ll prime = maxv + 1;
ll tmp = e / prime;
if(e % prime == 0) tmp--;
ans += tmp;
chmax(maxv, (ll)1);
}
cout << ans << endl;
return 0;
}
| 0 | 47,490,914 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define ArraySizeOf(array) (sizeof(array) / sizeof(array[0]))
#define res(i,n) for(int i=n;;i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define REV(i,n) for(int i=n-1;i>0;i--)
#define req(i,n,m) for(int i=n;i<m;i++)
#define REQ(i,n,m,l) for(int i=n;i<m;i+=l)
#define _GLIBCXX_DEBUG
int INF = 1e9 + 7;
long double PI = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998626034825342117;
unsigned NthDayOfWeekToDay(unsigned n, unsigned dow, unsigned dow1)
{
unsigned day;
if (dow < dow1) dow += 7;
day = dow - dow1;
day += 7 * n - 6;
return day;
}
signed gcd(long long x, long long y) {
if (y == 0)return x;
return gcd(y, x % y);
}
signed lcm(long long x, long long y) {
return x / gcd(x, y) * y;
}
unsigned DayToWeekNumber(unsigned day)
{
return (day - 1) / 7 + 1;
}
unsigned AnotherDayOfWeek(unsigned day, unsigned day0, unsigned dow0)
{
return (dow0 + 35 + day - day0) % 7;
}
using namespace std;
int main() {
vector<int>A(6);
rep(i, 6)cin >> A[i];
sort(A.begin(), A.end());
int a = 0;
int b = 0;
int c = 0;
int d = 0;
rep(i, 6) {
if (A[i] == 1)a++;
else if (A[i] == 2)b++;
else if (A[i] == 3)c++;
else d++;
}
if (a == 0 || b == 0 || c == 0 || d == 0) {
cout << "NO" << endl;
return 0;
}
if (a == 3 || b == 3 || c == 3 || d == 3) {
cout << "NO" << endl;
return 0;
}
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main(){
ll q,h,s,d; cin>>q>>h>>s>>d;
ll n; cin>>n;
ll res=q*4*n;
chmin(res, h*2*n);
chmin(res, s*n);
if(n%2==0) chmin(res, d*n/2);
else{
chmin(res, d*(n/2)+4*q);
chmin(res, d*(n/2)+2*h);
chmin(res, d*(n/2)+s);
}
cout<<res<<endl;
return 0;
}
| 0 | 80,841,930 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <stdexcept>
#include <algorithm>
#include <set>
#include <map>
#include <stdlib.h>
using namespace std;
int main(){
int A,B,C,D,a,b,c,p,q;
char aa,bb,cc;
cin >> p;
D = p % 10;
p /= 10;
C = p % 10;
p /= 10;
B = p % 10;
p /= 10;
A = p % 10;
p /= 10;
q = 0;
for(a = 0;a < 2;a++){
for(b = 0;b < 2;b++){
for(c = 0;c < 2;c++){
p = A;
if(a == 0){
p += B;
aa = '+';
}
else{
p -= B;
aa = '-';
}
if (b == 0){
p += C;
bb = '+';
}
else{
p -= C;
bb = '-';
}
if (c == 0){
p += D;
cc = '+';
}
else{
p -= D;
cc = '-';
}
if(p == 7){
cout << A << aa << B << bb << C << cc << D << "=7" << endl;
q = 1;
break;
}
}
if (q == 1){
break;
}
}
if (q == 1){
break;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
bool a=false,b=false,c=false,d=false;
for(int i=0;i<4;i++){
int A;
cin >> A;
if(A==1){
a=true;
}
if(A==4){
b=true;
}
if(A==7){
c=true;
}
if(A==9){
d=true;
}
}
if(a && b && c && d){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
}
| 0 | 87,506,410 |
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <iostream>
#include <bitset>
#include <cassert>
#include <queue>
#include <random>
#include <stack>
#include <iomanip>
using namespace std;
typedef unsigned int uint;
typedef long long llong;
typedef unsigned long long ullong;
typedef long double ldouble;
typedef vector<llong> vecllong;
typedef vector<vecllong> vvecllong;
const llong MOD = 1e9 + 7;
const llong INF = 1e17;
#define FOR(i, n) for (llong i = 0; i < n; i++)
#define FORS(i, a, b) for (llong i = a; i < b; i++)
#define FORR(i, n) for (llong i = n; i > 0; i++)
int main(void) {
llong A, B;
cin >> A >> B;
A--;
B--;
char ans[100][100];
FOR(i, 50) {
FOR(j, 100) {
ans[i][j] = '#';
ans[99 - i][j] = '.';
}
}
for(int i = 0; i < 50; i+=2) {
for(int j = 0; j < 100; j+=2) {
if (A<=0) {
i = 1000;
j = 1000;
break;
}
ans[i][j] = '.';
A--;
}
}
for(int i = 0; i < 50; i+=2) {
for(int j = 0; j < 100; j+=2) {
if (B<=0) {
i = 1000;
j = 1000;
break;
}
ans[99 - i][j] = '#';
B--;
}
}
cout << "100 100" << endl;
FOR(i, 100){
FOR(j, 100){
cout << ans[i][j];
}
cout << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdlib>
#include <cstring>
using namespace std;
int main(){
char s[200], p[100];
int len;\
cin >> s;
cin >> p;
len = strlen(s);
for(int i = 0; i < len; i++){
s[len+i] = s[i];
}
if(strstr(s, p) != NULL){
cout << "Yes" << endl;
}else {
cout << "No" << endl;
}
return 0;
}
| 0 | 14,714,841 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Z,W;
cin>>N>>Z>>W;
int a[N];
for(int i=0;i<N;i++){
cin>>a[i];
}
int ans=0;
if(N==1){
ans=abs(a[0]-W);
cout<<ans<<endl;
return 0;
}
int x1,x2,y1,y2;
x1=a[N-2];
y1=a[N-1];
x2=a[N-1];
y2=W;
if(abs(x1-y1)>abs(x2-y2)){
ans=abs(x1-y1);
}
else{
ans=abs(x2-y2);
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 505, INF = 1e9 + 7;
const char colors[2][2] = {{'R', 'Y'}, {'G', 'B'}};
int n, m, d;
char cl[N][N];
inline pair < int, int > tr(int x, int y){
return make_pair(x + y, x - y);
}
inline pair < int, int > inv_tr(int x, int y){
if((x + y) % 2 || (x - y) % 2){
return make_pair(-1, -1);
}
return make_pair((x + y) / 2, (x - y) / 2);
}
inline bool check(pair < int, int > a){
return 1 <= a.first && a.first <= n && 1 <= a.second && a.second <= m;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m >> d;
vector < pair < int, int > > q;
q.push_back(tr(1, 1));
q.push_back(tr(n, 1));
q.push_back(tr(1, m));
q.push_back(tr(n, m));
int mnX = +INF, mnY = +INF,
mxX = -INF, mxY = -INF;
for(auto it : q){
mnX = min(mnX, it.first);
mnY = min(mnY, it.second);
mxX = max(mxX, it.first);
mxY = max(mxY, it.second);
}
bool cl1 = 0, cl2 = 0;
for(int i = mnX; i <= mxX; i += d){
for(int j = mnY; j <= mxY; j += d){
for(int ii = i; ii <= i + d - 1; ii++){
for(int jj = j; jj <= j + d - 1; jj++){
auto it = inv_tr(ii, jj);
if(check(it)){
cl[it.first][it.second] = colors[cl1][cl2];
}
}
}
cl2 ^= 1;
}
cl1 ^= 1;
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
cout << cl[i][j];
}
cout << "\n";
}
}
| 0 | 47,437,075 |
#include <bits/stdc++.h>
using namespace std;
using usize = ::std::size_t;
using u64 = ::std::int_least64_t;
static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;
#define mod 1000000007
u64 modinv(u64 a, u64 m) {
u64 b = m, u = 1, v = 0;
while (b) {
u64 t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
u64 F[1000007], FInv[1000007];
void generate(){
FInv[0] = F[0] = 1;
for (int i = 1; i < 1000007; i++) {
F[i] = (F[i - 1]*i) % mod;
FInv[i] = (FInv[i - 1] * modinv(i, mod)) % mod;
}
}
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
u64 X, Y;
cin >> X >> Y;
u64 W, H;
W = 2* X - Y, H = 2*Y - X;
if (W < 0 || H < 0 || W % 3 || H % 3) {
cout << 0 << endl;
return 0;
}
generate();
u64 ans = 1;
W /= 3, H /= 3;
ans = (ans * F[W+H]) % mod;
ans = (ans * FInv[W]) % mod;
ans = (ans * FInv[H]) % mod;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <math.h>
#include <iomanip>
#include <string.h>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
#define PI 3.14159265358979323846264338327950L
#define INF 0x3f3f3f3f
int sum(int l, int r) {
return (l + r)*(r - l + 1) / 2;
}
int gcd(int a, int b) {
if (b == 0) {
return a;
}
else {
return gcd(b, a%b);
}
}
int32_t main() {
IOS;
int K;
cin >> K;
queue<int> q;
vector<int> ans;
for (int i = 1; i <= 9; i++) {
q.push(i);
ans.push_back(i);
}
if (K <= ans.size()) {
cout << ans[K - 1] << endl;
return 0;
}
while (true) {
if (ans.size() >= K) {
cout << ans[K - 1] << endl;
break;
}
int tmp = q.front();
q.pop();
for (int i = -1; i <= 1; i++) {
int curr = tmp % 10;
curr += i;
if (curr < 0 || curr > 9)
continue;
int newN = tmp * 10 + curr;
q.push(newN);
ans.push_back(newN);
}
}
}
| 0 | 99,609,442 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#define long long long
using namespace std;
int main() {
int n;
long k;
cin >> n >> k;
long a[n];
for (auto &ai:a) cin >> ai;
sort(a, a+n);
int l = -1, r = n;
while (r - l > 1) {
int m = (l + r + 1) / 2;
bool dp[k];
fill(dp, dp+k, 0);
dp[0] = true;
for (int i=0; i<n; i++) {
if (i == m) continue;
for (long j=k-1-a[i]; j>=0; j--)
dp[j+a[i]] |= dp[j];
}
long start = max(k-a[m], 0ll);
if (any_of(dp+start, dp+k, [](bool b) { return b; }))
r = m;
else
l = m;
}
cout << r << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int h,w,m;
cin>>h>>w>>m;
vector<set<int>> b(h);
vector<int> sums_h(h,0);
vector<int> sums_w(w,0);
int bh,bw;
for(int i=0;i<m;i++){
cin>>bh>>bw;
sums_h.at(bh-1)++;
sums_w.at(bw-1)++;
b.at(bh-1).insert(bw-1);
}
int result=0;
int max_h=0;
int max_w=0;
vector<int> index_h;
vector<int> index_w;
for(int i=0;i<h;i++){
if(max_h<sums_h.at(i)){
max_h=sums_h.at(i);
index_h.clear();
index_h.push_back(i);
}else if(max_h==sums_h.at(i)){
index_h.push_back(i);
}
}
for(int j=0;j<w;j++){
if(max_w<sums_w.at(j)){
max_w=sums_w.at(j);
index_w.clear();
index_w.push_back(j);
}else if(max_w==sums_w.at(j)){
index_w.push_back(j);
}
}
for(int i=0;i<index_h.size();i++){
for(int j=0;j<index_w.size();j++){
if(!b.at(index_h.at(i)).count(index_w.at(j))){
cout<<max_h+max_w<<endl;
return 0;
}
}
}
cout<<max_h+max_w-1<<endl;
}
| 0 | 18,493,458 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main(){
string s;
int w;
cin >> s >> w;
for(int i=0; i<s.length(); i+=w) cout << s[i];
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 123456;
int n;
ll a[N];
int main() {
ll single = 0;
ll sm = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
single += i + 1;
scanf("%lld", &a[i]);
sm += a[i];
}
if (n == 1) {
puts("YES");
return 0;
}
if (sm % single != 0) {
puts("NO");
return 0;
}
ll cnt = sm / single;
ll tot = 0;
for (int i = 0; i < n; i++) {
ll d = a[(i + 1) % n] - a[i];
if ((cnt - d) % n != 0 || (cnt - d) / n > cnt || (cnt - d) / n < 0) {
puts("NO");
return 0;
}
tot += (cnt - d) / n;
}
puts("YES");
}
| 0 | 76,981,273 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int t;
string s;
int a[100001]={0};
int countw=0,countr=0;
while(m--)
{
cin>>t;
cin>>s;
if(s=="WA")
{
if(a[t]!=-1)
a[t]++;
}
else
{
if(a[t]>=0)
{
countw+=a[t];
countr++;
a[t]=-1;
}
}
}
cout<<countr<<" "<<countw<<endl;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define pai 3.141592653589793238462643383279
int main(){
int keta=-1; ll pow[11]; pow[0] = 1;
rep(i, 10){
pow[i+1] = pow[i]*10;
}
for(int i=0; i<=10; i++){
cout << "? " << flush;
cout << pow[i] << flush;
cout << endl << flush;
char c; cin >> c;
if(c=='N'){
keta = i; break;
}
}
if(keta==-1){
for(int i=0; i<=10; i++){
cout << "? " << flush;
cout << (ll)2LL*pow[i] << endl << flush;
char c; cin >> c;
if(c=='Y'){
cout << "! " << pow[i] << endl << flush; return 0;
}
}
}
vector<int> made;
for(int i=1; i<=keta; i++){
ll ng = -1, ok = 9;
if(i==1) ng = 0;
while(abs(ok-ng)>1){
ll mid = (ok+ng)/2;
cout << "? " << flush;
for(auto k: made){
cout << k << flush;
}
cout << mid << flush;
rep(i, keta-made.size()){
cout << 9 << flush;
}
cout << endl;
cout << flush;
char c; cin >> c;
if(c=='Y') ok = mid;
else ng = mid;
}
made.push_back(ok);
}
cout << "! " << flush;
for(auto k: made){
cout << k << flush;
}
cout << endl; cout << flush; return 0;
}
| 0 | 90,075,086 |
#include<stdio.h>
int main(){
int a[3],i,c,f=0;
scanf("%d %d %d",&a[0],&a[1],&a[2]);
for(i=0;i<3;i++){
for(c=0;c<3;c++){
if(a[i]<a[c]){
f=a[i];
a[i]=a[c];
a[c]=f;
}
}
}
printf("%d %d %d\n",a[0],a[1],a[2]);
return(0);
}
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
string s, t;
cin >> s >> t;
string ans = s;
bool ok = false;
for(int i = s.length() - 1; i >= 0; --i)
{
bool in = true;
for(int j = t.length() - 1; j >= 0; --j)
{
if (i + j >= s.length())
{
in = false;
break;
}
in &= (s[i + j] == t[j] || s[i + j] == '?');
}
if (in)
{
for(int j = 0; j < t.length(); ++j)
{
ans[i + j] = t[j];
}
ok = true;
break;
}
}
for(int i = 0; i < ans.length(); ++i)
{
if (ans[i] == '?') ans[i] = 'a';
}
cout << (ok ? ans : "UNRESTORABLE");
}
int main()
{
fastio;
solve();
return 0;
}
| 0 | 70,442,661 |
#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()
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;
#define int ll
void solve()
{
string s;
cin>>s;
vector<int>pos;
int ans=0;
if(s[0]=='<')s='>'+s,--ans;
if(s.back()=='>')s+='<',--ans;
int n=s.size();
rep(i,n-1){
if(s[i]=='>'&&s[i+1]=='<')pos.pb(i);
}
int pre=0;
for(auto x:pos){
int p=x;
int cnt=0;
while(p>=0&&s[p]=='>'){
++cnt;
--p;
}
if(pre>cnt)--cnt;
else ans-=pre;
ans+=(cnt*(cnt+1))/2;
p=x+1;
cnt=0;
while(p<n&&s[p]=='<'){
++cnt;
++p;
}
ans+=(cnt*(cnt+1))/2;
pre=cnt;
}
cout<<ans<<"\n";
}
#undef int
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; i++)
const int MAX_N = 100;
int main(){
int A, B; cin >> A >> B;
cout << MAX_N << " " << MAX_N << endl;
vector<vector<char> > ans(MAX_N, vector<char>(MAX_N));
rep(i, 0, 100){
rep(j, 0, 100){
if(i < 50) ans[i][j] = '.';
else ans[i][j] = '#';
}
}
int cnt = 1;
int idx_i = 0, idx_j = 0;
while(cnt < B){
ans[idx_i][idx_j] = '#';
cnt++;
if(idx_j == 98){
idx_j = 0;
idx_i += 2;
}else{
idx_j += 2;
}
}
cnt = 1;
idx_i = 99, idx_j = 0;
while(cnt < A){
ans[idx_i][idx_j] = '.';
cnt++;
if(idx_j == 98){
idx_j = 0;
idx_i -= 2;
}else{
idx_j += 2;
}
}
rep(i, 0, MAX_N){
rep(j, 0, MAX_N){
cout << ans[i][j];
}
cout << endl;
}
return 0;
}
| 0 | 84,533,811 |
#include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s ; i < n ; i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
int main(){
int n,Y,M,D;
int sum_day;
cin >>n;
rep(i,n){
cin >>Y>>M>>D;
sum_day=0;
while(1){
if(Y==1000 && M==1 && D==1)break;
D++;
sum_day++;
if(Y%3==0){
if(D > 20){
M++;
D=1;
}
}else{
if(M%2 == 0 && D > 19){
M++;
D=1;
}else if(M%2 != 0 && D > 20){
M++;
D=1;
}
}
if(M > 10){
Y++;
M=1;
}
}
cout<<sum_day<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
ll n,m;
ll dp[6500][6500]={0};
void solve(ll *s, ll *t){
memset(dp, 0,sizeof dp);
for(ll i=1;i<=n;i++){
for(ll j=1;j<=m;j++){
if(s[i-1]==t[j-1])
dp[i][j] = (1 + dp[i-1][j]%mod + dp[i][j-1]%mod)%mod;
else
dp[i][j] = ((dp[i-1][j]%mod + dp[i][j-1])%mod - dp[i-1][j-1]%mod + mod) %mod;
}
}
}
int main() {
cin>>n>>m;
ll s[n],t[m];
for(ll i=0;i<n;i++)cin>>s[i];
for(ll i=0;i<m;i++)cin>>t[i];
solve(s,t);
cout<< (dp[n][m] + 1) %mod;
return 0;
}
| 0 | 64,605,685 |
#include <bits/stdc++.h>
using namespace std;
int h, w;
bool check(int i, int j){
if(i >= 0 && i < h && j >= 0 && j < w) return true;
return false;
}
int main(){
cin >> h >> w;
vector<string>a(h);
for(int i = 0; i < h; i++){
cin >> a[i];
}
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(a[i][j] == '#'){
if(check(i-1, j)){
if(a[i-1][j] == '#'){
continue;
}
}
if(check(i, j-1)){
if(a[i][j-1] == '#'){
continue;
}
}
if(check(i+1, j)){
if(a[i+1][j] == '#'){
continue;
}
}
if(check(i, j+1)){
if(a[i][j+1] == '#'){
continue;
}
}
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
const long long mod = 2019;
int main(){
ll l, r;
cin >> l >> r;
if (l==0 || r/2019-(l-1)/2019>0) cout << 0 << endl;
else {
l %= mod;
r %= mod;
if (r < l) r += mod;
ll ans = mod;
for (int i=l; i<=r; ++i) for (int j=i+1; j<=r; ++j) {
ans = min(ans, i*j%mod);
}
cout << ans << endl;
}
return 0;
}
| 0 | 16,502,538 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define yes cout << "yes" << endl
#define NO cout << "NO" << endl
#define No cout << "No" << endl
#define no cout << "no" << endl
using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFL = 1e18;
const double PI = 3.141592653589793;
const double EPS = 1e-9;
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(a > b) { a = b; return true; } return false; }
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int N; cin >> N;
string s; cin >> s;
int nest = 0;
string ans = "";
REP(i, N)
{
if(s[i] == '(') nest++;
else nest--;
if(nest < 0) ans.pb('('), nest++;
}
ans += s;
while(nest > 0) ans.pb(')'), nest--;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int n, m;
cin >> n >> m;
vector<vector<bool>> g(n, vector<bool>(n));
rep(i, m) {
int a, b;
cin >> a >> b;
--a; --b;
g[a][b] = g[b][a] = true;
}
vi b(n);
rep(i, n) b[i] = i;
ll ans = 0;
do {
bool ok = true;
rep(i, n-1) {
if (!g[b[i]][b[i+1]]) ok = false;
}
if (ok) ++ans;
} while (next_permutation(b.begin()+1, b.end()));
cout << ans << endl;
return 0;
}
| 0 | 5,973,391 |
#include <cstdio>
const int kMaxN = 2000000;
const int kMaxAi = 10000;
void CountingSort (int A[], int B[], int k, int n) {
int i;
int C[k + 1] = {};
for (i = 0; i < n; ++i) { ++C[A[i]]; }
for (i = 1; i < k + 1; ++i) { C[i] += C[i - 1]; }
for (i = n - 1; i > -1; --i) {
B[C[A[i]] - 1] = A[i];
--C[A[i]];
}
}
int main() {
int n, i;
std::scanf("%d", &n);
int A[n], B[n];
for (i = 0; i < n; ++i) { std::scanf("%d", &A[i]); }
CountingSort(A, B, kMaxAi, n);
for (i = 0; i < n - 1; ++i) { std::printf("%d ", B[i]); }
std::printf("%d\n", B[n - 1]);
return 0;
}
|
#include <iostream>
#include <cstring>
using namespace std;
char Right[11] = {'y','u','i','o','p','h','j','k','l','n','m'};
int main(){
string str;
while(cin >> str){
if(str[0] == '#') break;
int ans = 0;
bool position = false;
for(int i = 0; i < 11; i++){
if(Right[i] == str[0]){
position = true;
break;
}
}
for(int i = 1; i < str.size(); i++){
bool now = false;
for(int j = 0; j < 11; j++){
if(Right[j] == str[i]){
now = true;
break;
}
}
if(position != now){
ans++;
position = now;
}
}
cout << ans << endl;
}
}
| 0 | 88,880,638 |
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 200003;
int n;char str[MaxN];
int f[MaxN],dp[MaxN];
map<int,int> mn;
int main() {
scanf("%s",str+1);
n=strlen(str+1);
for (int i=1;i<=n;++i) {
f[i]=f[i-1]^(1<<(str[i]-'a'));
}
for (int i=1;i<=n;++i) mn[f[i]]=0x7f7f7f7f;
mn[0]=0;
for (int i=1;i<=n;++i) {
dp[i]=0x7f7f7f7f;
if (mn.count(f[i])) dp[i]=min(dp[i],mn[f[i]]+1);
for (int j=0;j<26;++j) {
int t=f[i]^(1<<j);
if (mn.count(t)) dp[i]=min(dp[i],mn[t]+1);
}
mn[f[i]]=min(mn[f[i]],dp[i]);
}
printf("%d\n",dp[n]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn=110000;
long long a[maxn];
const int INF=1<<30;
int n;
long long l;
long long q;
int f[maxn][35]={};
inline void init()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",a+i);
scanf("%d%d",&l,&q);
for(int i=1;i<=n;i++)
{
int x=(int)(upper_bound(a+1,a+n+1,a[i]+l)-a-1);
f[i][0]=x;
}
for(int j=1;j<=30;j++)
{
for(int i=1;i<=n;i++)
f[i][j]=f[f[i][j-1]][j-1];
}
}
inline void work_()
{
while(q--)
{
long long a,b;
scanf("%lld %lld",&a,&b);
if(a>b)
swap(a,b);
int ans=0;
int cur=a;
for(int i=30;i>=0;i--)
{
if(f[cur][i]<b)
{
ans+=1<<i;
cur=f[cur][i];
}
}
printf("%d\n",ans+1);
}
}
int main()
{
init();
work_();
return 0;
}
| 0 | 11,494,808 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << fixed << setprecision(0);
int D, T, S;
cin >> D >> T >> S;
cout << (T * S >= D ? "Yes" : "No") << endl;
return 0;
}
|
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define int long long
#define ll long long
#define eps LDBL_EPSILON
#define mod (int)1000000007
#define DBLINF (DBL_MAX)/10
#define P pair<int,int>
#define prique(T) priority_queue<T,vector<T>,greater<T>>
#define all(V) V.begin(),V.end()
#ifdef int
constexpr int INF = LLONG_MAX / 10;
#else
constexpr int INF = INT_MAX / 10;
#endif
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
if (lhs < rhs) {
lhs = rhs;
return 1;
}
return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
if (lhs > rhs) {
lhs = rhs;
return 1;
}
return 0;
}
using namespace std;
inline int gcd(int a, int b) {
while (b) {
int c = a;
a = b; b = c % b;
}
return a;
}
inline int lcm(int a, int b) {
return a / gcd(a, b) * b;
}
bool isprime(int n) {
if (n == 1)return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)return false;
}
return true;
}
int mypow(int a, int b) {
if (!b)return 1;
if (b & 1)return mypow(a, b - 1) * a;
int memo = mypow(a, b >> 1);
return memo * memo;
}
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 / 2, m);
return memo * memo % m;
}
int n, a, b, cnt[100010], parent[100010];
vector<int> vec[100010];
bool used[100010];
queue<int> leaf;
void dfs(int node) {
used[node] = true;
bool isparent = false;
for (int i : vec[node]) {
if (!used[i]) {
isparent = true;
parent[i] = node;
dfs(i);
}
}
if (!isparent) {
leaf.push(node);
}
}
signed main() {
cin >> n;
if (n % 2) {
puts("First");
return 0;
}
rep(i, n - 1) {
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
cnt[a]++; cnt[b]++;
}
dfs(1);
fill(used + 1, used + n + 1, false);
while (!leaf.empty()) {
int node = leaf.front();
leaf.pop();
if (node == 1 || used[parent[node]]) {
puts("First");
return 0;
}
used[node] = true;
used[parent[node]] = true;
if (parent[node] != 1 && !used[parent[parent[node]]]) {
cnt[parent[parent[node]]]--;
if (cnt[parent[parent[node]]] == 1) {
leaf.push(parent[parent[node]]);
}
}
}
REP(i, n) {
if (!used[i]) {
puts("First");
return 0;
}
}
puts("Second");
return 0;
}
| 0 | 98,918,026 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; 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;
}
const int inf = 1000000007;
const int MOD = 1000000007;
const long long INF = 1000000000000000007;
const double pi = 3.141592653589793;
vector<int> a;
int N;
map<int, int> cnt;
int main() {
cin >> N;
rep(i, 0, N) {
int t;
cin >> t;
a.push_back(t);
++cnt[t];
}
ll ans = 0;
for (auto e : cnt) {
int n = e.first;
int c = e.second;
if (c >= n) {
ans += c - n;
} else {
ans += c;
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pl;
#define all(a) (a).begin(),(a).end()
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=(a);i<(b);i++)
#define rrep(i,n) for(ll (i)=(n)-1;(i)>=0;i--)
#define SHOW(x) cout << #x << ": " << x << endl;
const ll INF=1e18;
const int iINF = 1e9;
int main(){
int n,ans,cnt_2 = 0;
bool flag = false;
unordered_map<int,int>mp;
cin>>n;
ans = n;
vector<int>a(n);
rep(i,n){
cin>>a[i];
mp[a[i]]++;
}
for(auto itr:mp){
if(itr.second%2 == 1){
ans -= itr.second - 1;
}
else{
ans -= itr.second - 2;
cnt_2++;
}
}
ans -= cnt_2 - cnt_2%2;
if(cnt_2%2 == 1) ans -= 2;
cout<<ans<<endl;
}
| 0 | 46,332,308 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int N = s.size();
int L = -1;
int R = -1;
for (int i = 0; i < N - 1; i++){
if (s[i] == s[i + 1]){
L = i + 1;
R = i + 2;
}
}
for (int i = 0; i < N - 2; i++){
if (s[i] == s[i + 2]){
L = i + 1;
R = i + 3;
}
}
cout << L << ' ' << R << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(all(a));
int cnt = 1, ans = 0;
for (int i = 1; i < n; i++) {
if (a[i] == a[i-1]) {
cnt++;
}
else if (cnt != a[i-1]) {
ans += cnt >= a[i-1] ? cnt - a[i-1] : cnt;
cnt = 1;
}
else {
cnt = 1;
}
}
if (cnt != a[n-1]) {
ans += cnt >= a[n-1] ? cnt - a[n-1] : cnt;
}
cout << ans << '\n';
return 0;
}
| 0 | 78,372,836 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int q; cin >> q;
for (int i = 0; i < q; i ++) {
long long a, b; cin >> a >> b;
long long root = sqrt(a*b);
long long ans = root + (a*b-1)/root-1;
if(a!=b)--ans;
cout << ans << endl;
}
}
|
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1){
if(a[md] <= key){
right = md;
}else{
left = md;
}
md = (right + left) / 2;
}
if(left == -1) return -1;
return right;
}
vector<ll> prime;
void Prime(ll n){
vector<ll> p(n,0);
p[0]=1;
p[1]=1;
for(ll i=2;i<n;i++){
if(p[i]==0){
prime.push_back(i);
p[i]=i;
}
ll k=prime.size();
for(ll j=0;j<k && i*prime[j]<n && prime[j]<=p[i];j++){
p[i*prime[j]]=prime[j];
}
}
}
ll gcd(ll a,ll b){
if(a<b){
swap(a,b);
}
ll r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
return b;
}
#define MOD ((ll)1e+9 + 7)
int main(){
ll a;
string s;
cin>>a>>s;
ll b=100*(s[0]-'0') + 10*(s[2]-'0') + s[3]-'0';
ll ans=a*((ll)b);
ans/=100;
cout<<ans<<endl;
return 0;
}
| 0 | 27,187,929 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define All(a) a.begin(),a.end()
#define INF 1000000007
const int MOD = 1000000007;
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
bool isPrime(int n){
if(n < 2) return false;
else if(n == 2) return true;
else if(n%2==0) return false;
for(int i=3;i<=sqrt(n);i++){
if(n%i==0) return false;
}
return true;
}
int main(){
int r;
cin >> r;
cout<< r*r <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
const ld PI = acosl(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<vector<char>> S(N, vector<char>(N));
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
cin >> S[i][j];
ll ans = 0;
for (int i = 0; i < N; ++i) {
{
bool flag = true;
for (int j = 0; j < N && flag; ++j) {
for (int k = j + 1; k < N && flag; ++k) {
int ktmp = k - i, jtmp = j - i;
if (ktmp < 0)
ktmp += N;
if (jtmp < 0)
jtmp += N;
if (S[j][ktmp] != S[k][jtmp])
flag = false;
}
}
if (flag)
ans += N - i;
}
if (i != 0) {
bool flag = true;
for (int j = 0; j < N && flag; ++j) {
for (int k = j + 1; k < N && flag; ++k) {
int ktmp = k - i, jtmp = j - i;
if (ktmp < 0)
ktmp += N;
if (jtmp < 0)
jtmp += N;
if (S[jtmp][k] != S[ktmp][j])
flag = false;
}
}
if (flag)
ans += N - i;
}
}
cout << ans << endl;
return 0;
}
| 0 | 15,711,707 |
#include <iostream>
using namespace std;
int main() {
int n;
long res = 1;
cin >> n;
for (int i = 2; i <= n; i++) {
res *= i;
}
cout << res << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::pair<T, U>& p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
int n = 0;
for (auto e : vec) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& st) {
int n = 0;
for (auto e : st) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T, class U>
std::ostream& operator<<(std::ostream& os, const std::map<T, U>& mp) {
int n = 0;
for (auto e : mp) os << (n++ ? ", " : "{") << e;
return os << (n ? "}" : "{}");
}
template <class T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& e : vec) is >> e;
return is;
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void debug_out() { std::cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head&& head, Tail&&... tail) {
std::cerr << head;
if (sizeof...(Tail) != 0) std::cerr << ", ";
debug_out(std::forward<Tail>(tail)...);
}
using namespace std;
using int64 = long long;
void move_keta(vector<int>& keta) {
if (keta[2] == 9) {
if (keta[1] == 9) {
keta[0]++;
keta[1] = 0;
keta[2] = 0;
} else {
keta[1]++;
keta[2] = 0;
}
} else {
keta[2]++;
}
}
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
vector<int> keta = {0, 0, 0};
int hyaku, zyuu, iti;
for (int pin = 0; pin < 1000; pin++) {
hyaku = zyuu = iti = -1;
for (int i = 0; i < N; i++) {
if (S[i] - '0' == keta[0]) {
hyaku = i;
break;
}
}
if (hyaku == -1) {
move_keta(keta);
continue;
}
for (int i = hyaku + 1; i < N; i++) {
if (S[i] - '0' == keta[1]) {
zyuu = i;
break;
}
}
if (zyuu == -1) {
move_keta(keta);
continue;
}
for (int i = zyuu + 1; i < N; i++) {
if (S[i] - '0' == keta[2]) {
iti = i;
break;
}
}
if (iti == -1) {
move_keta(keta);
continue;
}
ans++;
move_keta(keta);
}
cout << ans << endl;
return 0;
}
| 0 | 42,892,462 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int n, c = 0;
cin >> n;
string s[n], si, x;
int t[n], ti;
REP(i, n) cin >> s[i] >> t[i];
cin >> x;
bool f = false;
REP(i, n) {
if (s[i] == x) {
f = true;
continue;
}
if (!f) continue;
c += t[i];
}
cout << c << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,h;
cin >> n >> h;
int a[n],b[n];
for(int i=0;i<n;i++)cin >> a[i] >> b[i];
sort(a,a+n);
sort(b,b+n);
int ans=0;
for(int i=n-1;i>=0;i--){
h -= b[i];
ans++;
if(h<=0)break;
if(a[n-1]>b[i-1])break;
}
if(h<=0){
cout << ans;
return 0;
}
cout << ans + (h+a[n-1]-1)/a[n-1];
}
| 0 | 3,397,688 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main(){
string s,t;
cin>>s>>t;
ll ca = 0;
for(ll i=0; i<3; i++){
if(s.at(i)==t.at(i)){
ca++;}}
cout << ca << endl;}
|
#include <iostream>
#include <string>
using namespace std;
class dice{
public:
int t[7][6];
dice(){
}
void ready(){
t[1][1]=t[5][0], t[1][2]=t[4][0], t[1][3]=t[2][0], t[1][4]=t[3][0], t[1][5]=t[5][0];
t[2][1]=t[1][0], t[2][2]=t[4][0], t[2][3]=t[6][0], t[2][4]=t[3][0], t[2][5]=t[1][0];
t[3][1]=t[1][0], t[3][2]=t[2][0], t[3][3]=t[6][0], t[3][4]=t[5][0], t[3][5]=t[1][0];
t[4][1]=t[1][0], t[4][2]=t[5][0], t[4][3]=t[6][0], t[4][4]=t[2][0], t[4][5]=t[1][0];
t[5][1]=t[1][0], t[5][2]=t[3][0], t[5][3]=t[6][0], t[5][4]=t[4][0], t[5][5]=t[1][0];
t[6][1]=t[2][0], t[6][2]=t[4][0], t[6][3]=t[5][0], t[6][4]=t[3][0], t[6][5]=t[2][0];
}
};
int main(){
dice D2;
for(int i=1; i<7; i++){
cin >> D2.t[i][0];
}
D2.ready();
int n,top,front,table,cher;
cin >> n;
for(int i=0; i<n; i++){
cin >> top >> front;
for(int i=1; i<7; i++){
if(D2.t[i][0]==top)table=i;
}
for(int i=1; i<5; i++){
if(D2.t[table][i]==front)cher=i+1;
}
cout << D2.t[table][cher] << endl;
}
return 0;
}
| 0 | 37,474,932 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<math.h>
using namespace std;
int main(){
int tmp;
int asum = 0;
int bsum = 0;
for (int i = 0; i < 4; i++) {
cin >> tmp;
asum += tmp;
}
for (int i = 0; i < 4; i++) {
cin >> tmp;
bsum += tmp;
}
if (asum > bsum) {
cout << asum;
}
else cout << bsum;
cout << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-3;
int dx[4]={0,1,0,1};
int dy[4]={0,0,1,1};
vector<int> G[100010];
ll a[100010];
bool ans;
void dfs(int v,int p){
ll sum=0;
ll ma=0;
if(G[v].size()==1)return;
for(auto e:G[v]){
if(e==p)continue;
dfs(e,v);
sum+=a[e];
ma=max(ma,a[e]);
}
if(a[v]>sum){
ans=false;
}else if(a[v]<sum){
if(ma>a[v]){
ans=false;
}
if((sum-a[v])*2LL>sum){
ans=false;
}else{
a[v]=sum-(sum-a[v])*2LL;
}
}
}
int main(){
ans=true;
int n;cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
if(n==2){
if(a[0]!=a[1]){
cout<<"NO"<<endl;
}else{
cout<<"YES"<<endl;
}
return 0;
}
for(int i=0;i<n-1;i++){
int a,b;cin>>a>>b;a--;b--;
G[a].push_back(b);
G[b].push_back(a);
}
int v;
for(int i=0;i<n;i++){
if(G[i].size()!=1){
v=i;
break;
}
}
dfs(v,-1);
if(a[v])ans=false;
if(ans){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
}
| 0 | 96,148,778 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
vector<string> ret;
if (depth == 0)
{
ret.push_back(s);
return ret;
}
for (ll i = 0; i < symbol.size(); i++)
{
auto vec = dfs(s + symbol[i], depth - 1, symbol);
for (auto &&e : vec)
{
ret.push_back(e);
}
}
return ret;
}
ll gcd(ll a, ll b)
{
if (a % b == 0)
{
return b;
}
return gcd(b, a % b);
}
int main()
{
ll X, A, B;
cin >> X >> A >> B;
string ans;
if (A >= B) {
ans = "delicious";
} else if (X >= (B - A)) {
ans = "safe";
} else {
ans = "dangerous";
}
cout << ans << endl;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>
#include <iomanip>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
typedef long long ll;
int main(){
while(true){
int n;
cin>>n;
if(n==0)break;
int t=1000-n;
int ans=0;
ans+=t/500;
t=t%500;
ans+=t/100;
t=t%100;
ans+=t/50;
t=t%50;
ans+=t/10;
t=t%10;
ans+=t/5;
t=t%5;
ans+=t;
cout<<ans<<endl;
}
return 0;
}
| 0 | 57,572,547 |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=a;i<b;++i)
int main() {
int A = 0, B = 0, a;
for_(i,0,4) scanf("%d", &a), A += a;
for_(i,0,4) scanf("%d", &a), B += a;
printf("%d\n",max(A,B));
return 0;
}
|
#include <stdio.h>
int main(void)
{
int i;
int d;
int ans;
while (scanf("%d", &d) != EOF){
ans = 0;
for (i = d; i <= 600 - d; i += d){
ans += (i * i) * d;
}
printf("%d\n", ans);
}
return (0);
}
| 0 | 70,935,945 |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr ll inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
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 fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
bool isprime(int n) {
if(n==1)return false;
if(n==2)return true;
for(int i = 2;i<=sqrt(n);i++) {
if(n%i==0) return false;
}
return true;
}
#pragma endregion
signed main() {
int n;cin >> n;
vector<P> v(n);
rep(i, n) {
cin >> v[i].first;
v[i].second=i+1;
}
sort(all(v));
rep(i, n)cout << v[i].second << ' ';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dh[8] = {0, 0, 1, 1, 1, -1, -1, -1};
const int dw[8] = {1, -1, 0, 1, -1, 0, 1, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * (B / gcd(A, B));
}
using Graph = vector<vector<int>>;
Graph G;
int main(){
vector<int> a(3);
rep(i, 3) cin >> a[i];
int count = 0;
while(true){
sort(a.begin(), a.end());
int MAX = *max_element(a.begin(), a.end());
int MIN = *min_element(a.begin(), a.end());
if(MAX == MIN){
cout << count << endl;
return 0;
}
if(MAX >= MIN + 2) a[0] += 2;
else a[2]--;
count++;
}
}
| 0 | 80,381,767 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll a,b;
cin>>a>>b;
if(a>=b){
cout<<10<<endl;
return 0;
}
cout<<0<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define maxs(x,y) x = max(x, y)
#define mins(x,y) x = min(x, y)
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1<<29);
int main() {
ll N;
cin >> N;
ll sumA = 0, sumB = 0;
vector<ll> A(N);
REP(i, N) {
cin >> A[i];
sumA += A[i];
}
vector<ll> B(N);
REP(i, N) {
cin >> B[i];
sumB += B[i];
}
if (sumA < sumB) {
cout << -1 << endl;
return 0;
}
ll fusoku = 0;
vector<ll> yuyo;
ll cnt = 0;
REP(i, N) {
if (A[i] < B[i]) {
fusoku += B[i] - A[i];
cnt ++;
}
if (A[i] > B[i]) yuyo.push_back(A[i] - B[i]);
}
sort(RALL(yuyo));
while(fusoku > 0) {
fusoku -= yuyo[0];
cnt++;
yuyo.erase(yuyo.begin());
}
cout << cnt << endl;
return 0;
}
| 0 | 81,094,158 |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main(){
io();
ll n; cin >> n;
return cout << n*(n - 1)/2 << '\n', 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = (1<<29);
long long calc_digit(long long N){
long long res = 0;
while(N){
res++;
N /= 10;
}
return res;
}
void solve(long long N){
long long ans = INF;
for(long long A = 1; A * A <= N; A++){
if(N % A == 0){
long long B = N / A;
long long F = max(calc_digit(A), calc_digit(B));
ans = min(ans, F);
}
}
cout << ans << endl;
}
int main(){
long long N;
scanf("%lld",&N);
solve(N);
return 0;
}
| 0 | 50,867,681 |
#include <iostream>
#include <string>
#include <queue>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int n;
cin >> n;
int total = 0;
int ans = 0;
int dif = 0;
for (int i=1;i<=n;i++){
total = total + i;
if (total >= n){
ans = i;
dif = total-n;
break;
}
}
for (int i=1;i<=ans;i++){
if (i!=dif){
cout << i << endl;
}
}
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<vector<vector<int> > > vvvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000
#define LLINF 2000000000000000000LL
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k;
cin >> n >> k;
vll h(n+1);
h[0]=0;
REP(i,n) cin >> h[i+1];
vvll dp(n+1, vll(n+1,LLINF));
dp[0][0] = 0LL;
dp[1][1] = h[1];
for(int i=2;i<=n;++i){
dp[i][1]=h[i];
for(int j=2;j<=i;++j){
for(int l=1;l<i;++l){
dp[i][j] = min(dp[i][j], dp[l][j-1]+max(0LL,h[i]-h[l]));
}
}
}
ll ans = LLINF;
REP(i,n+1){
ans = min(ans, dp[i][n-k]);
}
cout << ans << endl;
return 0;
}
| 0 | 56,877,555 |
#include<bits/stdc++.h>
using namespace std;
#define l long int
#define ll long long int
vector<int>adj[1000001];
int vis[1000001];
int n=2005;
int dp[2005];
int fact[1000001];
#define mod 1000000007
ll sequence_sum(int a)
{
if(a==0)
return 1ll;
else if(a==1 || a==2)
return 0ll;
else if(a==3 || a==4 || a==5)
return 1ll;
else if(dp[a]!=-1)
return dp[a];
else
{
ll total=0;
for(int i=3;i<=a;i++)
{
if((a-i)>=0)
{
total=(total+sequence_sum(a-i))%mod;
}
}
return dp[a]=total;
}
}
int main()
{
int s;
cin>>s;
for(int i=0;i<=n;i++)
{
dp[i]=-1;
}
dp[0]=0;
cout<<sequence_sum(s)<<"\n";
return 0;
}
|
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#define RG register
using namespace std;
const int N=103;
int n,a[N],maxx,num[N];
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
while(ch>='0' && ch<='9'){x=x*10+ch-'0'; ch=getchar(); }
ot=x*f;}
template<typename I, typename... U> inline void read(I &x,U&... y){read(x); read(y...);}
template<typename I>inline I mx(const I&a,const I&b){return a>b ? a : b;}
inline void endd(){printf("Impossible\n"); exit(0);}
int main()
{
read(n);
for(RG int i=1;i<=n;i++) read(a[i]), maxx=mx(maxx,a[i]), num[a[i]]++;
if(maxx&1)
{
for(RG int i=maxx-maxx/2;i<=maxx;i++) if((num[i]-=2)<0) endd();
for(RG int i=maxx-maxx/2;i;i--) if(num[i]) endd();
}
else {
num[maxx/2]--;
for(RG int i=maxx/2+1;i<=maxx;i++) if((num[i]-=2)<0) endd();
for(RG int i=maxx/2;i;i--) if(num[i]) endd();
}
printf("Possible\n");
return 0;
}
| 0 | 21,802,989 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<double> x(n);
vector<string> u(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> u[i];
}
double sum = 0.0;
for (int i = 0; i < n; i++) {
if (u[i].compare("JPY") == 0) {
sum += x[i];
}
if (u[i].compare("BTC") == 0) {
sum += (380000.0 * x[i]);
}
}
cout << sum << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
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];
}
}
int Q;
cin >> Q;
vi L(Q), R(Q);
rep(i, Q) {
cin >> L[i] >> R[i];
}
vector<pair<int, int>> G(H * W + 1);
rep(i, H) {
rep(j, W) {
G[A[i][j]] = make_pair(i + 1, j + 1);
}
}
vl sum(H * W + 1);
for (int i = H * W; i > H * W - D; i--) {
sum[i] = 0;
}
for (int i = H * W - D; i >= 1; i--) {
sum[i] = sum[i + D] + abs(G[i].first - G[i + D].first) + abs(G[i].second - G[i + D].second);
}
rep(i, Q) {
cout << (sum[L[i]] - sum[R[i]]) << endl;
}
}
| 0 | 43,873,128 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c; cin>>a>>b>>c;
bool ans=false;
for(int i=1; i<=b; i++){
if(a*i%b==c){
ans=true;
break;
}
}
cout<<(ans?"YES":"NO");
}
|
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define watch(x); cout << "\n" << #x << " is: " << x << "\n";
#define ll long long int
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
#define nl cout<<"\n"
#define gcd(a,b) __gcd(a,b)
#define sq(a) (a)*(a)
#define loop(i,a,b) for (ll i = a; i <= b; i++)
#define rloop(i,a,b) for (int i = a; i >= b; i--)
#define sz(a) a.size()
#define mod 1000000007
#define PI 2*acos(0.0)
int main()
{
IOS
int T=1;
while(T--)
{
ll n,k;
cin>>n>>k;
ll ans=0;
for(ll i=k;i<=n+1;i++)
{
ll mn=(i-1)*i/2;
ll mx=(2*n-i+1)*i/2;
ans+=mx-mn+1;
ans%=mod;
}
cout<<ans;
}
return 0;
}
| 0 | 80,386,520 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <random>
#include <iterator>
using namespace std;
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(v) reverse((v).begin(),(v).end())
#define ANS(ans) cout<<(ans)<<endl;
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
typedef vector<int> VI;
typedef pair<int, int> P;
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
ANS((n - 2) * 180);
return 0;
}
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
#define D()
#define INF 1000000000000
#define MOD 10000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define INITA(a,i,j,v) for(ll k=i;k<=j;k++){a[k]=v;}
int main() {
int n, m; cin >> n >> m;
int a[200001]; INITA(a, 0, 200000, 0);
int b[200001]; INITA(b, 0, 200000, 0);
set<int> st;
REP(i, m) {
cin >> a[i] >> b[i];
if (a[i] == 1) {
st.insert(b[i]);
}
if (b[i] == 1) {
st.insert(a[i]);
}
}
REP(i, m) {
if ((st.find(a[i]) != st.end()) && (b[i] == n)) {
cout << "POSSIBLE" << endl;
return 0;
} else if ((st.find(b[i]) != st.end()) && (a[i] == n)) {
cout << "POSSIBLE" << endl;
return 0;
}
}
cout << "IMPOSSIBLE" << endl;
return 0;
}
| 0 | 95,113,577 |
#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 9;
const int infint = 1e9 + 7;
const int MAXN = 2e5 + 7;
const double eps = 1e-9;
const long double pi = 3.1415926535897932384626433832795;
const long double e = 2.71828182845904523536028747135266;
inline ll read()
{
ll kr = 1, xs = 0;
char ls;
ls = getchar();
while (!isdigit(ls))
{
if (!(ls ^ 45))
kr = -1;
ls = getchar();
}
while (isdigit(ls))
{
xs = (xs << 1) + (xs << 3) + (ls ^ 48);
ls = getchar();
}
return xs * kr;
}
inline ull readull()
{
ull xs = 0;
char ls;
ls = getchar();
while (!isdigit(ls))
ls = getchar();
while (isdigit(ls))
{
xs = (xs << 1) + (xs << 3) + (ls ^ 48);
ls = getchar();
}
return xs;
}
inline void writeull(ull x)
{
if (x < 0)
{
x *= -1;
putchar('-');
}
if (x >= 10)
writeull(x / 10);
putchar('0' + x % 10);
}
inline void write(ll x)
{
if (x < 0)
{
x *= -1;
putchar('-');
}
if (x >= 10)
write(x / 10);
putchar('0' + x % 10);
}
char a[MAXN];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--)
{
scanf("%s",a);
int now=0;
for (int i=0;a[i];i++){
now+=(a[i]-'0');
now%=9;
}
if(!now) printf("Yes\n");
else printf("No\n");
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cstring>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define PER(i, a, b) for(int i = a; i >= b; i--)
#define LL long long
#define lowbit(x) x &(-x)
template<class T>inline void chkmax(T &x, const T &y) {if(x < y) x = y;}
template<class T>inline void chkmin(T &x, const T &y) {if(y < x) x = y;}
inline int read() {
int x = 0, flag = 1;char ch = getchar();
while(!isdigit(ch)) {
if(ch == '-') flag = - 1;
ch = getchar();
}
while(isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return x * flag;
}
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
char c[N];
long long ans = 1;
int sum = 0, a[N], n;
int main() {
n = read();
scanf("%s", c);
a[1] = 0; sum = 1;
if(c[0] == 'W') {
cout << 0 << endl;
return 0;
}
REP(i, 2, 2 * n) {
if(a[i - 1]) {
if(c[i - 1] == c[i - 2]) a[i] = 0;
else a[i] = 1;
} else {
if(c[i - 1] == c[i - 2]) a[i] = 1;
else a[i] = 0;
}
if(a[i]) {
ans = ans * sum % mod;
sum --;
} else sum ++;
}
if(sum) {
cout << 0 << endl;
return 0;
}
REP(i, 2, n) ans = ans * i % mod;
printf("%lld\n", ans);
return 0;
}
| 0 | 8,857,952 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<map>
#include<set>
#include<algorithm>
#define ll long long
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 300004
#define INF 1e9+7
using namespace std;
ll n;
string stn;
string tostr(ll x)
{
string res="";
string tmp = "0";
while(x)
{
tmp[0] = x%10;
x/=10;
res+=x;
}
return res;
}
ll query(ll x)
{
cout << "? " << x << "\n";
cout.flush();
char c='N';
cin >> c;
return (c=='Y');
}
ll EX(ll v,ll e)
{
ll p = 1;
rep(i,0,e)
p*=v;
return p;
}
int main()
{
ios_base::sync_with_stdio(false);
if(query(1000000000000))
{
ll low = 1;
ll high = 11;
ll digits = 12;
while(low <= high)
{
ll mid = (low+high)/2;
bool q = query(EX(10,mid)-1);
if(q)
{
high=mid-1;
digits=min(digits,mid);
}
else
{
low=mid+1;
}
}
cout << "! "<<EX(10,digits-1) << "\n";
cout.flush();
return 0;
}
ll low = 1;
ll high = 9;
ll digits = 1;
while(low <= high)
{
ll mid = (low+high)/2;
bool q = query(EX(10,mid));
if(q)
{
low = mid+1;
digits = max(digits,mid+1);
}
else
{
high=mid-1;
}
}
ll answer = 0;
rep(i,0,digits-1)
{
low = 0;
high = 9;
ll d = 0;
while(low <= high)
{
ll mid = (low+high)/2;
bool q = query(answer*10+mid);
if(q)
{
low=mid+1;
d=max(d,mid);
}
else
{
high=mid-1;
}
}
answer = answer*10+d;
}
low = 0;
high = 9;
ll d = 9;
while(low <= high)
{
ll mid = (low+high)/2;
bool q = query(answer*100+10*mid+0);
if(q)
{
high=mid-1;
d=min(d,mid);
}
else
{
low=mid+1;
}
}
answer = answer*10+d;
cout << "! " <<answer << "\n";
cout.flush();
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define Y first
#define X second
#define INF 1 << 30
#define EPS 1e-10
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef pair<pi, pi> pipi;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;
int H, W, N;
char field[1024][1024];
int dy[] = {0,1,0,-1}, dx[] = {1,0,-1,0};
int main(){
scanf("%d%d%d", &H, &W, &N);
rep(i, H) scanf("%s", field[i]);
int x, y;
rep(i, H) rep(j, W) if(field[i][j] == 'S'){ y = i; x = j; break;}
map<pi, int>m;
m[MP(y, x)] = 1;
queue<pipi>q;
q.push(MP(MP(1, 0), MP(y, x)));
while(!q.empty()){
pipi p = q.front(); q.pop();
if(field[p.S.Y][p.S.X] == p.F.F + '0'){
if(p.F.F == N){
printf("%d\n", p.F.S);
break;
}
m.clear();
while(!q.empty()) q.pop();
m[MP(p.S.Y, p.S.X)] = 1;
p.F.F++;
}
rep(d, 4){
int ny = p.S.Y + dy[d], nx = p.S.X + dx[d];
int hp = p.F.F, c = p.F.S;
if(ny < 0 || ny >= H || nx < 0 || nx >= W || field[ny][nx] == 'X' || m.count(MP(ny, nx))) continue;
m[MP(ny, nx)] = 1;
q.push(MP(MP(hp, c+1), MP(ny, nx)));
}
}
return 0;
}
| 0 | 13,560,912 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll m=0,s=0,a=n;
while(a!=0) s++, a/=10;
for(ll i=s-1;i>=0;i--) m+=n/((ll)pow(10,i))-(n/((ll)pow(10,i+1)))*10;
return m;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
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 Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
const int MAX_N=100010;
vector<bool> sieve_of_eratosthenes(){
vector<bool> isPrime(MAX_N+1,true);
for(int i=2;i<=MAX_N;i++){
if(isPrime[i]){
for(int j=2*i;j<=MAX_N;j+=i){
isPrime[j]=false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
const int MAX_V=100010;
struct edge{ll to,cost;};
typedef pair<ll,ll> pint;
ll n;
ll INF=1e16;
vector<edge> graph[MAX_V];
ll dist[MAX_V];
void dijkstra(ll s){
priority_queue<pint,vector<pint>,greater<pint>> que;
fill(dist,dist+n,INF);
dist[s]=0;
que.push(pint(0,s));
while(!que.empty()){
auto p=que.top();que.pop();
ll v=p.second;
if(dist[v]<p.first) continue;
for(auto e:graph[v]){
if(dist[e.to]>dist[v]+e.cost){
dist[e.to]=dist[v]+e.cost;
que.push(pint(dist[e.to],e.to));
}
}
}
}
int main() {
IOS;
cin>>n;
rep(i,n-1){
ll a,b,c;cin>>a>>b>>c;a--;b--;
graph[a].push_back(edge{b,c});
graph[b].push_back(edge{a,c});
}
ll q,k;cin>>q>>k;
dijkstra(k-1);
rep(i,q){
ll x,y;cin>>x>>y;x--;y--;
cout<<dist[x]+dist[y]<<endl;
}
}
|
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>
using namespace std;
class Solution {
public:
};
int main(int argc, char** argv) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> A(m);
for (int i = 0; i < m; ++i) {
cin >> A[i];
}
sort(A.begin(), A.end());
vector<int> costs{0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
vector<pair<int,int>> dp(n + 1, make_pair(-1, -1));
dp[0] = make_pair(0, 0);
for (int i = 1; i <= n; ++i) {
for (int j = m - 1; j >= 0; --j) {
int ct = costs[A[j]];
if (i >= ct && dp[i - ct].first >= 0) {
dp[i] = max(dp[i], make_pair(dp[i - ct].first + 1, A[j]));
}
}
}
string res;
int cur = n;
while (cur > 0) {
int x = dp[cur].second;
res += (char)('0' + x);
cur -= costs[x];
}
cout << res << '\n';
return 0;
}
| 0 | 25,593,951 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.