code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, N;
cin >> N >> A;
cout << N * N - A;
return 0;
} | #include<cstdio>
#include<cstring>
int main() {
char str[1001], cmd[8], p[1001], tmp;
int q, i, a, b, j;
scanf("%s%d", str, &q);
for (i = 0; i < q; i++) {
scanf("%s%d%d", cmd, &a, &b);
if (strcmp(cmd, "print") == 0) {
for (j = a; j <= b; j++) printf("%c", str[j]);
printf("\n");
}
else if (strcmp(cmd, ... | 0 | 4,467,680 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
using Graph = vector<vector<int>>;
int n,m,ans=0;
Graph g;
vector<bool>seen;
void dfs(int x){
seen[x]=true;
bool flag=true;
rep(i,n){
if(!seen[i]){
flag=fals... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | 0 | 31,049,445 |
#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(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
ll n;
cin >> n;
cout << n*(n-1)/2 << endl;
} | # include <iostream>
# include <deque>
using namespace std;
string S;
int K;
deque<int> d;
int counter=0;
long long ans=0;
bool allsame=true;
int main()
{
cin>>S;
cin>>K;
char current=S[0];
for (int i=0; i<S.size(); i++)
{
if (S[i]==current)
{
counter++;
}
... | 0 | 62,978,772 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < n; i++)
const ll mod = 1000000007;
int main() {
int n,m;
cin >> n >> m;
int s[n];
rep(i,n) cin >> s[i];
int t[m];
rep(i,m) cin >> t[i];
ll dp[n+1][m+1];
rep(i,n+1) rep(j,m+1) dp[i... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | 0 | 7,298,464 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int r,g,b;
int k;
cin >> r >> g >> b;
cin >> k;
int good = 0;
for(int i = 0 ; i < k ; i++){
if(r >= b){
b *= 2;
}else if(r >= g){
g *= 2;
}else if(g >= b){
b *= 2;
}
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | 0 | 98,762,706 |
#include <bits/stdc++.h>
using namespace std;
pair<long, long> divide(long h, long w) {
long s = h * w;
if (s % 2 == 0) return make_pair(s / 2, s / 2);
if (h > w) swap(h, w);
long s1 = h * (w / 2);
return make_pair(s1, s - s1);
}
int main() {
long h, w, ans = 1l << 62;
cin >> h >> w;
if (h % 3 == 0 || w... | #include<bits/stdc++.h>
using namespace std;
#define ll long int
int main()
{
string s;
cin>>s;
ll l=s.length();
ll i=0, j=l-1;
ll cnt=0;
while(j-i>=0)
{
if(s[i]==s[j])
{
i++;
j--;
}
else if(s[i]=='x')
{
i++;
... | 0 | 76,824,400 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
ll l,r;
cin>>l>>r;
ll ans=3000;
for(int i=l;i<=min(r,l+3000);i++){
for(int j=i+1;j<=min(... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
using ll = long long;
using ... | 0 | 9,272,511 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int begin = 0;
int end = 2*N-2;
int query;
bool flag = true;
string S;
cout << 0 << endl;
fflush(stdout);
cin >> S;
if(S == "Vacant"){
flag = false;
}
while(flag){
string T;
query = (begin + end)/2;
if(qu... | 0 | 39,817,190 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int l;
cin >> l;
double a = l/3.0;
printf("%.12lf\n",a*a*a);
return 0;
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define mod 1000000007
#define ... | 0 | 39,245,699 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
#define testP cout ... | 0 | 36,194,690 |
#include <iostream>
using namespace std;
int main(){
int N; cin >> N;
int res = 0;
int cnt = 0;
int prev = -1;
for(int i=0;i<N;i++){
int a; cin >> a;
if(a != prev){
res += cnt/2;
cnt = 1;
} else {
++cnt;
}
prev = a;
}
... | #include <bits/stdc++.h>
using namespace std;
long INF = 1e16;
long divPlusOneIfModExist(long target, long div) {
return (target+div-1L)/div;
}
int main() {
long N;
cin >> N;
long A[N+1];
for (int i = 0; i <= (int)N; i++) {
cin >> A[i];
}
long maxNodes[N+1];
maxNodes[0] = 1L;
for (int i = 1; i <... | 0 | 53,681,634 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using P = pair<int, int>;
using V = vector<int>;
constexpr array<int, 4> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
constexpr int INF = 1234567890, MOD = 1000000000 + 7;
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;... | #include <bits/stdc++.h>
using namespace std;
int f(int x) {
printf("%d\n", x); fflush(stdout);
char buf[255];
scanf("%s", buf);
if (buf[0] == 'V') exit(0);
return buf[0] == 'M';
}
int main() {
int N; scanf("%d", &N);
int L = 0, Lt = f(L);
int R = N - 1, Rt = f(R);
while (1) {
... | 0 | 53,572,606 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int a,b,c;cin>>a>>b>>c;
for(int i=1;i<b;i++){
int d=a*i;
if(d%b==c){
cout<<"YES"<<endl;
return 0;
}
}
cout<<"NO"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
const double PI = 3.141592653589793238460;
const int INF = 1e9+5;
int ans = INF;
int x;
void recur(int cost[], vector<int> books[], vector<int>& knowledge, int start, int n, int m, int& res){
bool flag=true;
for(int i = 0; ... | 0 | 17,687,025 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define ... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17;
void warshall_floyd(vector<vector<long long>> &dist, vector<vector<long long>> &prev) {
int V = dist.size();
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if ... | 0 | 55,934,080 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <stack>
#include <queue>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace st... | #include <bits/stdc++.h>
using namespace std;
int md;
int add(int x, int y) {
x += y;
if (x >= md) {
x -= md;
}
return x;
}
int mul(int x, int y) {
return (int)((long long)x * y % md);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n >> md;
string s;
cin >> s;
map<int,... | 0 | 34,281,469 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
cout << (n+k-3)/(k-1) << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | 0 | 38,731,350 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
#define INF 1<<29
using Graph = vector<vector<int>>;
Graph d;
void warshall_floyd(int V) {
rep(k,V)
rep(i,V)
rep(j,V) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
int main() ... | 0 | 37,279,986 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<deque>
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n,L,T;
int a[N],x[N],w[N];
int main()
{
scanf("%d%d%d",&n,&L,&T);
int rk=0;
for(int i=0;i<n;i++){
scanf("%d%d",&a[i],&w[i]);
if(w[i]==1){
x[i]=... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | 0 | 55,791,537 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ll N, X, M;
cin >> N >> X >> M;
vector<int> f(M, -1);
ll ans = 0;
ll A = X;
vector<int> v;
for (int i = 0; i < N; i++) {
if (f[A] == -1) {
ans += A;
f[A] = i;
v.push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n; ll k; cin>>n>>k;
map<int, ll> mp;
for(int i = 0; i < n; i++){
int a, b;
cin>>a>>b;... | 0 | 19,958,054 |
#include <bits/stdc++.h>
using namespace std;
struct xy{
double x, y;
};
void koch(int n, xy a, xy b){
if(n == 0) return;
xy s, t, u;
double v = M_PI * 60.0/180.0;
s.x = (a.x*2 + b.x)/3;
s.y = (a.y*2 + b.y)/3;
t.x = (a.x + b.x*2)/3;
t.y = (a.y + (b.y*2))/3;
u.x = (t.x - s.x)*cos(v) - (t.y - s.y)*sin(v... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int len(int n, int a){
if(a>=n){
return a-n*(a/n);}
else{ return a;}
}
int main(){
int n;
cin>>n;
c... | 0 | 91,915,930 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>> a(h+2, vector<char>(w+2));
vector<vector<int>> b(h+2, vector<int>(w+2));
for(int i=1;i<h+1;i++){
for(int j=1;j<w+1;j++){
... | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
bool ans = true;
cin >> n;
... | 0 | 18,383,585 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a == b) cout << c << endl;
else if(b == c) cout << a <<endl;
else cout << b << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll n,m;cin>>n>>m;
map<ll,ll> mp;
rep(i,0,2*m){
ll a;
cin>>a;
mp[a]++;
}
for(auto i:mp){
if(i.second%2==1){
cout<<"NO"<<endl;
... | 0 | 34,842,345 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | #include <bits/stdc++.h>
using namespace std;
int main () {
long long N,K;
cin >> N >> K;
vector<long long>A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<long long>counta(N,0);
vector<long long>countb(N,0);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (A.at(... | 0 | 95,141,198 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define co cout
#define ci cin
#define sf1(n) scanf("%lld",&n)
#define sf2(n,m) scanf("%lld %lld",&n,&m);
#define sf3(n,m,p) scanf("%lld %lld %lld",&n,&m,&p);
#define pf1(n) printf("%lld\n",n);
#define en cou... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i, s, n) for(int i=(s); i<=(n); ++i)
#define outl(x) cout<< (x) << '\n'
using namespace std;
class UnionFind {
private:
int *par;
int *rank;
const size_t N;
public:
UnionFind(... | 0 | 63,059,429 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int g = 1;
for (int i = min(a, b); i > 0; i--)
{
if (a % i == 0 && b % i == 0)
{
g = i;
break;
}
}
if (c % g == 0)
{
puts("YES");
}
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 55,732,151 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
long long n, c, k;
cin >>n >>c >>k;
vector<long long> t(n);
for(int i = 0; i < n; ++i)
cin >>t[i];
sort(begin(t), end(t));
long long b = 0, cnt = 0, bt = 0;
for(int i = 0; i < n; ++i){
if(t[i] > bt || cnt == c){
bt = ... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define ET cout << "\n"
#define SZ(a) ((int)a.size())
#define... | 0 | 4,259,569 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <bitset>
#include <climits>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<(b);i++... | #include <iostream>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int h;
int w;
while(cin>>h>>w){
if(h == 0 && w == 0)
break;
for(int j = 0; j < h; j++){
for(int i = 0; i < w; i++){
cout << "#";
}
... | 0 | 47,455,138 |
#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(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; a < b; i++);
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se secon... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#def... | 0 | 14,914,005 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,q;
cin >>a>>b>>c;
q = 0;
while(a <= b){
if(c%a==0){
q++;
a++;
}
else{
a++;
continue;
}
}
cout <<q<<"\n";
} | #include <bits/stdc++.h>
#define LL long long
#define PB push_back
using namespace std;
const unsigned LL M = 1000000007;
int main(){
LL n,m;cin>>n>>m;
LL mat[n][m];
LL dp[n][m]={0};
for (LL i=0;i<n;i++){
string s; cin>>s;
for (LL j=0;j<m;j++){
if ... | 0 | 86,202,449 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>monster(N+1);
vector<int>hero(N);
for(int i=0;i<=N;i++){
cin>>monster[i];
}
for(int i=0;i<=N-1;i++){
cin>>hero[i];
}
long long ans=0;
for(int i=0;i<=N-1;i++){
if(hero[i]>=monster[i]){
ans... | 0 | 1,142,848 |
#include<bits/stdc++.h>
using namespace std;
#define rush ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define FOR(a,x,n) for(ll a=x;a<n;a++)
#define ROF(a,x,n) for(ll a=x;a>=n;a--)
#define pb push_back
#define lb lower_bound... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#include <cstring>
#define ll long long
using namespace std;
ll n,ans;
int main() {
scanf("%lld",&n);
for (int i=1;i<=n;++i)
ans=(ans+(n-i+1)*(1-i)+(i+n)*(n-i+1)/2);
for (int i=1;i<n;++i){
int u,v;s... | 0 | 47,537,295 |
#include <iostream>
using namespace std;
void test();
int sum_comb(int n);
using namespace std;
int main(void)
{
test();
return 0;
}
void test()
{
int n,comb;
while (cin >> n)
{
comb = sum_comb(n);
cout << comb << endl;
}
}
int sum_comb(int n)
{
int a, b, c, d,cnt;
cnt = 0;
for (a = 0; a <= 9; a++)
{
fo... | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define pb push_back
#define mp make_pair
#define clr(v,d) memset( v, d ,sizeof(v))
#define PI acos(-1)
typedef l... | 0 | 15,737,173 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
void solve() {
string a, b, c, d;
cin >>... | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sq... | 0 | 19,362,538 |
#include <iostream>
using namespace std;
int main() {
int n;
int max;
while(1) {
cin >> n;
if(n == 0) break;
int a[5010];
for(int i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
for(int i = 0; i < n; i++) {
int temp = 0;
for(int j = i; j < n; j++) {
temp += a[j];
if(temp > max) max = t... | #include<bits/stdc++.h>
using namespace std;
#define IOS cin.sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pii pair<int,int>
#define pb push_back
#define vi vector<int>
using ll = long long;
const int mod = 1e9 + 7;
ll pwr(ll a, ll b);
const int N = ... | 0 | 17,803,933 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<sstream>
#include<string.h>
#include<time.h>
#include<random>
#include<cmath>
#include<math.h>
#include<queue>
#include<time.h>
#include<iomanip>
#include<utility>
#define rt "\n"
#define rep(i,n) for(int i... | 0 | 9,718,575 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using P = pair<int, int>;
int main(){
string s, t;
cin >> s >> t;
bool can = false;
int index = 0;
re... | #include <bits/stdc++.h>
using namespace std;
template <class T> using vec = vector<T>;
template <class T, class U> using vep = vec<pair<T,U> >;
template <class T> using PQ = priority_queue<T>;
using ll = long long;
using vll = vec<ll>;
using pll = pair<ll, ll>;
using vpll = vec<pll>;
using str = string;
static const l... | 0 | 93,090,638 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read (T &x) {bool b = 0; char c; while (!isdigit (c = getchar()) && c != '-');
if (c == '-') c = getchar(), b = 1; x = c - 48; while (isdigit(c = getchar())) x = (x<<3) + (x<<1) + c - 48; if (b)x=-x;}
template <typename T> inline void wrip(... | #include <bits/stdc++.h>
using namespace std;
void err() {
cout << -1 << '\n';
exit(0);
}
void dfs (int crr, int dpt, vector<vector<int>>& grh, long long& cnt) {
cnt += dpt;
for (int nxt : grh[crr]) {
dfs(nxt, dpt + 1, grh, cnt);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin... | 0 | 48,641,352 |
#include<iostream>
using namespace std;
int main(){
bool p[1000000];
int num[1000000];
int c,n;
for(int i=0;i<1000000;i+=2)p[i] = false ;
for(int i=1;i<1000000;i+=2)p[i] = true ;
p[1] = false;
p[2] = true;
c=3;
while(c < 1000){
for(int i=3*c; i < 1000000; i+=2*c)p[i] = false;
do{c+=2;}while(!p[c]);
}
c=0... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
const ll N=1e6+9;
const ll mod=1e9+7;
ll a[N];
void solve()
{
ll n, m ,k;
cin >> n ;
vector<int> a(n), b(n), c(n) ;
for(int i=0 ; i<n; i++) {
cin >> a[i] >> b[i] >> c[i] ;
}
vector<vector<int>> dp(n, vector<int>(3)) ;
... | 0 | 16,309,790 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s,t;
cin >> s >> t;
int ans=0;
rep(i,s.length()){
if(s[i]!=t[i])
ans ++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
const int MAX_X = 1100;
const int MAX_Y = 1100;
int main() {
std::string X;
std::string Y;
int q;
int answers[160];
std::cin >> q;
int dp[MAX_X][MAX_Y];
for(int p=0; p<q; ++p) {
std::cin >> X;
std::cin >> Y;
for(int i=0; i<MAX_X; ++i) {
for(int j=0; ... | 0 | 23,713,833 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main()
{
int n;
cin >> n;
for (int ans = 111; ans <= 999; ans += 111)
if (ans >= n)
{
cout << ans << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> ans(26,100);
for(int i = 0; i < n; i++){
string s; cin >> s;
vector<int> cnt(26);
for(int j = 0; j < s.size(); j++){
int idx = s[j] - 'a';
cnt[idx]++;
}
for(int j = 0; j < 26; j++){
ans[j] ... | 0 | 49,089,172 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | #include "bits/stdc++.h"
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define li long int
#define ld long double
#define lld long long double
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
... | 0 | 89,593,608 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,n;
cin>>x>>n;
vector<int> k(n);
vector<bool> a(1000,true);
for(int i=0;i<n;i++){
cin>>k[i];
k[i]--;
a[k[i]]=false;
}
int p=0,q=0;
for(int i=x-1;i<1000;i++){
if(a[i]){
p=i+1;
break;
}
}
for(int i=x-1;i>=0;... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 92,038,996 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int name1,name2,name3;
cin >>name1>>name2;
name3=name2*2-name1;
cout<<name3<<endl;
} | #include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ctime>
#define int long long
#define dou... | 0 | 94,342,159 |
using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define INF 1000000000000000000LL
#define MOD 1000000007LL
#define infile "../test/sample-1.in"
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define ... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name".in", "r", stdin); \
freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#de... | 0 | 41,018,107 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
ll f(ll a) {
ll res[] = {a, 1, a+1, 0};
return res[a%4];
}
ll getXor(ll a, ll b) {
return f(b) ^ f(a-1);
}
int main()
{
ll l, r;
cin >> l >> r;
cout << getXor(l, r) << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m){
int arr[n];
int sum=0;
for(int i=0;i<n;i++){
cin>>arr[i];
sum+=arr[i];
}
sort(arr,arr+n,greater<int>());
int req=(sum)/(4*m);
if(req*(4*m)!=sum) req... | 0 | 66,530,011 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
#define int long long
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
signed main(){
int X,A,B;
cin>>X>>A>>B;
if(B-A<=X&&B-A>0) cout<<"safe"<<endl;
... | #include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se... | 0 | 58,949,273 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | 0 | 16,712,595 |
#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
#d... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 37,811,719 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n,k,x,y; cin >> n >> k >> x >> y;
if (n < k) {
cout << n * x << endl;
}
else {
cout << k * x + (n - k) * y << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int A,B;
cin >> A >> B;
if((A==1 && B==2) || (A==2 && B==1))
{
cout << "3" << endl;
}
else if((A==2 && B==3) || (A==3 && B==2))
{
cout << "1" << endl;
}
else
{
cout << "2" << endl;
}
} | 0 | 24,698,594 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<cmath>
#include <iomanip>
using namespace std;
int main(void){
double a,b,c,d,e,f,dod;
cin>>a>>b>>c>>d;
e=a-c;
f=b-d;
dod=pow(e,2)+pow(f,2);
dod=sqrt(dod);
cout<<setprecision(12)<<dod<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf=1e9;
const int64_t inf64=1e18;
cons... | 0 | 76,089,172 |
#include<bits/stdc++.h>
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;
int n,k,a[5005];
bitset<5005> sum;
bool judge(int x)
{
if(a[x]>=k)
return 1;
sum.reset();
sum[0]=1;
for(int i=1;i<=n;i++)
if(i!=x)
sum|=sum<<a[i];
for(int i=k-1;i>=k-a[x];i--)
if(sum[i])
... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long , long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x,d) cout<<fixed<<setprecision(d)<<x
#define fill(a,b) memset((a),(b),sizeof((a)))
#define... | 0 | 12,471,098 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (sca... | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <limits>
#include <climits>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;... | 0 | 98,314,113 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
long double J=0,B=0;
for(int i=0;i<N;i++){
long double X;
string S;
cin>>X>>S;
if(S=="JPY"){
J+=X;
}
else{
B+=X;
}
}
B*=380000.0;
B+=J;
cout<<fixed<<setprecision(15);
cout<<B<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 1000000007;... | 0 | 79,605,663 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long ;
int main(){
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h[i];
int dekai=0;
int cnt=0;
rep(i,n){
if(h[i]>dekai){
cnt++;
dekai = h[i]... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{... | 0 | 20,868,677 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define pf push_front
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#def... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<pair<string, int>> s(n);
rep(i, 0, n){
cin >> s[i].first >> s[i].second;
}
... | 0 | 11,336,771 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-12;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T>
void printv(const vector<T> &v)
{
int sz = v.size();
for (int i =... | 0 | 81,214,048 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N;
cin >> N;
ll ans = 180 * (N - 2);... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
const int MOD = 1e9+7;
ll power(ll a, ll b){
ll r=1;
while(b>0){
if(b&1)
r=r*a %MOD;
a = a*a %MOD;
b/=2;
}
return r;
}
int main(){
string a, b;
... | 0 | 79,571,870 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
int r , d , x;
cin >> r >> d >> x;
for(int i = 0;i < 10;i++){
x = r * x - d;
cout << x << end... | #include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | 0 | 34,800,353 |
#include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define sz(v) (int) v.size()
#define pr(v) For(i, 0, sz(v)) {cout<<v[i]<<" ";} cout<<endl;
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 81,179,838 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 51,539,725 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int d; cin >> d;
string res;
switch(d){
case 22:
res = "Christmas Eve Eve Eve";
break;
case 23:
res = "Christmas Eve Eve";
break;
case 24:
res = "Christmas Eve";
break;
case 25:
res = "Christmas";
... | #include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
using llint = long long int;
int n;
vector<int> va;
using vecitr = vector<int>::iterator;
int nearest(vecitr begin, vecitr end, int x)
{
bool first = true;
for (; begin != end; begin++)
{
if (*begin >= x)
{
... | 0 | 49,792,091 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int rating, goal;
cin >> rating >> goal;
cout << (goal * 2) - rating << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
int sum = 0;
for(int i = 0; i < n; i++){
cin>>a[i];
sum+=a[i];
}
int avg = ceil(float(sum)/n);
int avg2 = floor(float(sum)/n);
int cost = 0;
int cost2 = 0;
for(int i = 0; i < n;... | 0 | 26,416,230 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int N, Num[100005], Max, Min = 987654321, result;
int abs(int num)
{
return num > 0 ? num : -num;
}
int main()
{
scanf("%d", &N);
for(int i = 0; i < N; i++)
{
scanf("%d", &Num[i]);
Max = max(Max, Num[i]);
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1234567;
int ans[42];
pair<int, int> a[N], b[N];
int main() {
int h, w, n;
scanf("%d %d %d", &h, &w, &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &a[i].first, &a[i].second);
for (int dx = 0; dx < 3; dx++) {
for (int dy = 0; dy < 3; dy+... | 0 | 53,608,262 |
#include <iostream>
using namespace std;
int main(void){
int N, s;
s = 0;
cin >> N;
for (int i = 1; i <= N; i++){
s = s + i;
}
cout << s << endl;
return 0;
} | #include<iostream>
#include<string>
#include<cstdint>
#include<alloca.h>
int64_t const MOD = 1e9+7;
std::string L;
int64_t const tbl[] = {1, 3, 5, 9, 11, 15, 19, 27, 29, 33, 37, 45, 49, 57, 65, 81};
int to_num(int k, char const* p) {
int res = 0;
while(--k>=0) { res = res*2 + (*p++ - '0'); }
return res;
}
bool is... | 0 | 95,281,093 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
struct Spell {
int64_t damage{};
int64_t cost{};
};
int main() {
int64_t h{}, n{};
std::cin >> h >> n;
std::vector<Spell> spells(n);
for (int64_t i = 0; i < n; i++) {
std::cin >> spells[i].damage >> spells[i].co... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | 0 | 46,151,240 |
#include<bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define repk(i,k,n) for (ll i = k; i < (ll)(n); ++i)
#define INF 1000000000
#define MOD 1000000007
typedef long long ll;
using namespace std;
string ans = "Yes";
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
map<cha... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
const ll MOD=1e9+7;
#define endl '\n'
#define F first
#define S second
#define pb push_back
const double PI = 3.141592653589793238460;
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.t... | 0 | 19,840,812 |
#include <iostream>
using namespace std;
double x[4],y[4],px,py,ax,ay,bx,by;
int main()
{
while(true)
{
for(int i = 1;i<=3;i++){cin >> x[i];cin >> y[i];}
if(cin.eof()){break;}
cin >> px;
cin >> py;
double m,n;
ax = x[2]-x[1];
ay = y[2]-y[1];
bx = x[3]-x[1];
by = y[3]-y[1];
px = px - x[1];
py = p... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_... | 0 | 52,548,836 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #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_st... | 0 | 77,281,247 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
int n;
cin>>n;
cout<<(n-2)*180<<endl;
}
signed main(){
solve();
} | #include <stdio.h>
#include <cmath>
int main(){
char s[8003] = {};
int x,y;
int gx[8000] ,gy[8000];
bool dx[8000][8000] ,dy[8000][8000];
scanf("%s\n", &s);
scanf("%d %d", &x, &y);
int i = 0;
while( s[i] == 'F'){
i++;
}
x = x-i;
i++;
x = std::abs(x);
y = std::... | 0 | 78,068,340 |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i,n) for (ll i = 0; i < n; i++)
#define vl vector<ll>
#define vpl vector<pair<ll,ll>>
#define vvl vector<vector<ll>>
#include<algorithm>
#include <iostream>
#include <vector>
#include <cstdlib>
templa... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll X,N;
cin>>X>>N;
set<ll> S;
for(ll i=0;i<N;i++) {
ll p;
cin>>p;
S.insert(p);
}
if(!S.count(X)) {
cout<<X<<endl;
return 0;
}
for(ll i=1;i<1000;i++) {
if(!S.count(X-i)) {
... | 0 | 12,394,046 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b)
{
if ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <sstream>
using namespace std;
int main()
{
int n;
cin >> n;
int birth[1000][11][21];
int ctn = 196470;
for (int y = 1; y < 1000; y++) {
for (int m = 1; m < 11; m++) {
int ma;
if (y % 3 == 0) ma = 20;
... | 0 | 56,678,940 |
#include <bits/stdc++.h>
using namespace std;
static const int INF = 10000007;
int main()
{
int h, w;
int ma[101][101];
cin >> h >> w;
string in;
for (int i = 1; i <= h; ++i)
{
cin >> in;
for (int j = 1; j <= w; ++j)
{
ma[i][j] = (in[j-1] == '#');
}
}
int dp[101][101] = {};
for (int i = 0; i < 101; ... | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i... | 0 | 23,300,891 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[5];
cin >> s;
if (s[0]==s[1] && s[1]==s[2]) puts("Yes");
else if (s[1]==s[2] && s[2]==s[3]) puts("Yes");
else puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int b[100010];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;cin>>n;
for(int i=0;i<n;i++)
{
int a;cin>>a;
b[a]++;
b[a+1]++;
b[a+2]++;
}
int ans=0;
for(int i=0;i<100010;i++)ans=max(ans,b[i]);
cout<... | 0 | 91,559,407 |
#include<iostream>
using namespace std;
int main() {
int height[10], i, a=0, b=0, c=0;
for (i = 0; i < 10; i++) {
cin >> height[i];
}
for (i = 0; i < 10; i++) {
if (height[i] >= a) {
c = b;
b = a;
a = height[i];
}
else if (height[i] >= b) {
c = b;
b = height[i];
}
else if (height[i] >= c)... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt... | 0 | 43,567,010 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int main()
{
_FastIO;
string s;
cin >> s;
int n = s.size();
int x = 0;
int ans = 753;
for(int i = 0; i < 3; ... | 0 | 57,683,633 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> p(124,0);
string s;
cin >> s ;
for ( int i=0 ; i<s.size() ; i++){
p[(int)(s.at(i))]++;
}
for ( int i=0 ; i<125 ; i++){
if (p[i]>=2){
cout << "no" << endl;
return 0;
}
}
cout << "yes" << endl;
} | #include<bits/stdc++.h>
using namespace std;
long long nexta[18][100001];
long long arr(long long from, long long days){
long long shisu=0;
while(days>0){
if(days%2==1){
from=nexta[shisu][from];
}
days/=2;
shisu++;
}
return from;
}
int main(){
long long N;... | 0 | 1,413,282 |
#include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
int x, y;
cin >> x >> y;
cout << x + y / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
string s;cin>>s;
ll countb = 0;
ll ans = 0;
int n = s.size();
for(int i = 0;i<n;++i){
if(s[i]=='W') {
ans+=countb;
}
... | 0 | 74,603,270 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#d... | #include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#... | 0 | 32,100,609 |
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> a(H,vector<char>(W));
vector<int> h(H);
vector<int> w(W);
rep(i,H){
rep(j,W){
cin >> a.at(i).at(j);
if... | 0 | 91,631,875 |
#include<bits/stdc++.h>
using namespace std;
#define pf printf
#define PF(a) printf("%d\n",(a))
#define PF2(a,b) printf("%d %d\n",(a), (b))
#define PF3(a,b,c) printf("%d %d %d\n",(a), (b), (c))
#define PFL(a) printf("%lld\n",(a))
#define PFL2(a,b) ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; ++i) {
cin >> A[i];
}
sort(A.rbegin(), A.rend());
long long W = 0, H = 0;
for(int i = 1; i < N; i++) {
if(A[i-... | 0 | 88,555,229 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string... | #include<iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
string comp;
if (a < b) {
comp = "a < b";
}
else if (a==b) {
comp = "a == b";
}
else {
comp = "a > b";
}
cout << comp.c_str() << std::endl;
return 0;
} | 0 | 63,647,277 |
#include<stdio.h>
#include<cstdio>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
#include<utility>
#include<queue>
#include<stack>
#define pi 3.14159
#define Inf (int)pow(2., 12.)
using namespace std;
typedef std::pair<int, int> mypair;
queue<mypair> qu;
#define M 1000000
int main(){
string ... | #include<stdio.h>
int main(void)
{
int w,h,x,y,r;
scanf("%d",&w);
scanf("%d",&h);
scanf("%d",&x);
scanf("%d",&y);
scanf("%d",&r);
if(x>=r && x+r<=w && y>=r && y+r<=h){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 0 | 95,993,378 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define arep(x,n) for (int x: n)
using namespace std;
using ll = long long;
int main()
{
int n; cin >> n;
set<ll> a;
ll tmp;
rep(i,n) {
cin >> tmp;
a.insert(tmp);
}
if(a.size() == n) cout << "YES" << endl;
... | #include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <cstring>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <s... | 0 | 91,577,372 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<string>
#include<bitset>
#include<random>
#include<ctime>
using namespace std;
typedef long long ll;
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cou... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
using ll = long long;
using namespace std;
template <typename T>
T gcd(T a, T b) {
if (a > b) {
T buf = a;
a = b;
b = buf;
}
return a == 0 ? b : gcd(a, b%a);
}
int main() {
int n, k;
... | 0 | 18,495,747 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | 0 | 80,992,604 |
#include <bits/stdc++.h>
using namespace std;
# define ll long long int
# define ld long double
# define pb push_back
# define pp pop_back
# define ff first
# define ss second
# define mp make_pair
# define ac accumulate
# define mod 1000000007
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int p[5005]... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int i=0,j=0,n,m,x,c[20000],a[200][200],saisyo=999999999999,u=0,g[100],k,q=0,i2,cc=0;
string b,b2;
cin >> n >> m >> x;
for(i=0;i<n;i++)
{
cin >> c[i];
for(j=0;j<m;j++)
{
cin >> a[i][j];
... | 0 | 33,017,913 |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef double db;
typedef long long ll;
#define pb push_back
#define FAST cin.sync_with_stdio(0); cin.tie(0);
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define arep(i, a, n) for(int i = a; i <= (n); ++i)
#define drep(i, a, n) for(int i =... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
const int INF = 1<<30... | 0 | 10,248,440 |
End of preview. Expand in Data Studio
- Downloads last month
- 9