content stringlengths 19 11k |
|---|
#include <stdio.h>
int main()
{
char a, b;
scanf("%c %c",&a,&b);
if(a=='H')
{
printf("%c\n",b);
}
else if(a=='D')
{
printf("%c\n",b=='H'?'D':'H');
}
return 0;
} |
#include <stdio.h>
int main() {
char character_a, character_t;
scanf("%c %c", &character_a, &character_t);
if(character_a == 'H') {
printf("%c\n", character_t);
} else {
if(character_t == 'H') {
printf("D\n");
} else {
printf("H\n");
}
}
return 0;
}
|
#include <stdio.h>
int main(void)
{
char a,b,str[16];
int c,d;
fgets(str,sizeof(str),stdin);
sscanf(str,"%c %c",&a,&b);
if(a == 'H')
{
c = 1;
}
else
{
c = 0;
}
if(b == 'H')
{
d = 1;
}
else
{
d = 0;
}
if((c+d)%2 == 0)
{
puts("H");
}
else
{
puts("D");
}
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main(void) {
int i;
char a, b;
char buf[128], *ch;
fgets(buf, sizeof(buf), stdin);
a = *strtok(buf, " ");
b = *strtok(NULL, " ");
if(a == 'H') {
printf("%c\n", b);
} else {
if(b == 'H') {
printf("D\n");
} else {
printf("H\n");
}
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(void){
char a[10],b[10];
scanf("%s %s",&a,&b);
if((strcmp(a,"H")==0)&&(strcmp(b,"H")==0)){printf("H");}
if((strcmp(a,"H")==0)&&(strcmp(b,"D")==0)){printf("D");}
if((strcmp(a,"D")==0)&&(strcmp(b,"H")==0)){printf("D");}
if((strcmp(a,"D")==0)&&(strcmp(b,"D")==0)){printf("H");}
return 0;
} |
#include<stdio.h>
char logic(char a, char b){
if (a == 'H'){
if(b == 'H'){
return 'H';
}else if(b == 'D'){
return 'D';
}
}else if(a == 'D'){
if(b == 'D'){
return 'H';
}else if(b == 'H'){
return 'D';
}
}
}
int main(){
char d, h;
scanf("%c %c", &d, &h); fflush(stdin);
printf("%c", logic(d, h));
return 0;
} |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#include <math.h>
int main(void){
char a[2], b[2];
scanf("%s%s", a, b);
if(a[0] == 'H'){
printf("%c\n", b[0]);
}else{
if(b[0] == 'H'){
printf("D\n");
}else{
printf("H\n");
}
}
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char a,b,c;
int f;
while(scanf("%c %c",&a,&b)!=EOF)
{
f=1;
if (a=='D') f=0;
c='H';
if (b=='D') c='D';
if (f==0&&c=='D') c='H';
else if (f==0&&c=='H') c='D';
printf("%c\n",c);
getchar();
}
return 0;
} |
#include <stdio.h>
#include <string.h>
int main (int argc,char **argv)
{
char a[2],b[2];
int c = 0,d = 0;
scanf("%s%s",a,b);
c = strcmp(a,"H");
d = strcmp(b,"H");
if ((c == 0) && (d == 0))
{
printf("H\n");
}
else if ((c == 0) && (d != 0))
{
printf("D\n");
}
else if ((c != 0) && (d == 0))
{
printf("D\n");
}
else
{
printf("H\n");
}
return 0;
} |
/*
A - HonestOrDishonest
<http://abc056.contest.atcoder.jp/tasks/abc056_a>
*/
#include <stdio.h>
int main(int argc, char const *argv[]) {
char a,b;
scanf("%c %c", &a, &b);
if( a == 'H' ){
if( b == 'H' ){
printf("H");
}else{
printf("D");
}
}else{
if( b == 'H' ){
printf("D");
}else{
printf("H");
}
}
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int main(void)
{
char a,b,D,H;
D='D';
H='H';
int tmp[4];
scanf("%c %c",&a,&b);
tmp[0]=a;
tmp[1]=b;
tmp[2]=H;
tmp[3]=D;
if(tmp[0]==tmp[2])
{
printf("%c\n",b);
}
if(tmp[0]==tmp[3]&&tmp[1]==tmp[2])
{
printf("D\n");
}
if(tmp[0]==tmp[3]&&tmp[1]==tmp[3])
{
printf("H\n");
}
return 0;
} |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <stdlib.h>
#include <stdbool.h>
#define MOD 1000000007
void input_array(int how_data,int *data);
int get_random(int min, int max);
int factorial(int n);
int fibonacci(int n);
int qsort_09(const int *sys1 , const int *sys2);
int qsort_90(const int *sys1 , const int *sys2);
int main(void){
char a,b;
scanf("%c %c",&a,&b);
a==b?printf("H\n"):printf("D\n");
return 0;
}
//how_data個の配列data[]に標準入力
//input_array(how_data,data);
void input_array(int how_data,int *data){
int loop;
for(loop=0;loop<how_data;loop++){
scanf("%d",&data[loop]);
}
}
int get_random(int min, int max){ //指定の範囲から乱数を1つ返すやつ
//srand((unsigned int)time(0)); //現在時刻で疑似乱数初期化
rand();rand();rand();rand(); //乱数を空打ち
return (rand()%(max+1-min))+min;
}
int factorial(int n){//n!のMOD10^9+7を返すやつ
unsigned long long int ret=1;
for(int i=1;i<=n;i++)ret=(ret*i)%1000000007;
return (int)ret;
}
int qsort_09(const int *sys1 , const int *sys2){ //小さいのが上にくるやつ
//qsort(data,how_data,sizeof(int),(int (*)(const void *,const void *))qsort_09);
if(*sys1<*sys2){
return -1;
}else if(*sys1==*sys2){
return 0;
}else{
return 1;
}
}
int qsort_90(const int *sys1 , const int *sys2){ //大きいのが上にくるやつ
//qsort(data,how_data,sizeof(int),(int (*)(const void *,const void *))qsort_90);
if(*sys1<*sys2){
return 1;
}else if(*sys1==*sys2){
return 0;
}else{
return -1;
}
}
int fibonacci(int n){
switch(n){
case 0:return 0;
case 1:return 1;
default :return fibonacci(n-1)+fibonacci(n-2);
}
}
|
main(a,b,c){scanf("%d%d%d",&a,&b,&c);printf("%d",a+b<c?c-a-b:a+c<b?b-a-c:0);} |
int main(w,a,b){scanf("%d %d %d",&w,&a,&b);int c=(a>=b?a:b)-((a<=b?a:b)+w);printf("%d",c<0?0:c);} |
#include<stdio.h>
int main(){
int W,a,b;
scanf("%d%d%d",&W,&a,&b);
printf("%d\n",-(W-=(b=(a-=b)>>31)^a+b)&W>>31);
} |
a;b;c;d;e;
main(){
scanf("%d%d%d",&a,&b,&c);
if((a+b>=c&&b<=c)||(a+c>=b&&c<=b))
printf("0\n");
else{d=b-(a+c);e=c-(a+b);
printf("%d\n",d>e?d:e);}} |
#include <stdio.h>
abs(int a){
return (a>0)?a:-1*a;
}
ans(int a){
return (a>0)?a:0;
}
int main(){
int w,a,b;
scanf("%d%d%d",&w,&a,&b);
printf("%d",ans(abs(b-a)-w));
return 0;
} |
#include <stdio.h>
int main(void){
int w, a, b, move=0;
scanf("%d%d%d", &w, &a, &b);
if(a<b) move=b-(a+w);
else move=a-(b+w);
printf("%d", move<0 ? 0:move);
return 0;
} |
#include<stdio.h>
int W, A, B;
int main(){
scanf("%d%d%d", &W, &A, &B);
if(A+W<B){
printf("%d\n", B-A-W);
}else if(B+W<A){
printf("%d\n", A-B-W);
}else{
printf("0\n");
}
}
|
#include <stdio.h>
int abs(int a){
return a>0?a:-a;
}
int main(void){
int w,a,b;
scanf("%d %d %d",&w,&a,&b);
if(abs(a-b)<=w){
puts("0");
}
else{
printf("%d\n",abs(a-b)-w);
}
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
int main() {
int w, a, b, tmp;
scanf("%d%d%d", &w, &a, &b);
if (a > b)
tmp = a, a = b, b = tmp;
printf("%d\n", a + w >= b ? 0 : b - (a + w));
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int main(){
int w,a,b;
scanf("%d%d%d",&w,&a,&b);
if(a+w<=b){
printf("%d",abs(b-(a+w)));
return 0;
}
if(b+w<a){
printf("%d",abs((b+w)-a));
return 0;
}
puts("0");
return 0;
} |
#include <stdio.h>
int main(void)
{
int a,b,w,s;
scanf("%d%d%d",&w,&a,&b);
s=a-b;
if(s<0)s=-s;
if(s<=w)printf("0\n");
else printf("%d\n",s-w);
return 0;
}
|
#include<stdio.h>
int main(){
int W,A,B;
int dis = 0;
scanf("%d %d %d",&W,&A,&B);
if(A<B){
dis = B-(A+W);
}else{
dis = A-(B+W);
}
if(dis<0){
printf("0");
}else{
printf("%d",dis);
}
return 0;
} |
#include <stdio.h>
main()
{
int a, b, w;
scanf("%d %d %d", &w, &a, &b);
if(b>a+w) printf("%d\n", b-a-w);
else if(b<=a+w && b+w>=a) printf("%d\n", 0);
else if(b+w<a) printf("%d\n", a-b-w);
}
|
#include <stdio.h>
int main(void){
int W, a, b, tmp,d;
scanf("%d %d %d", &W, &a, &b);
if(b<a){
tmp = b;
b = a;
a = tmp;
}
d = b - (a + W);
if(d <= 0 && d >= -W)
d = 0;
printf("%d\n", d);
return 0;
} |
#include <stdio.h>
#include <string.h>
int main(void)
{
int w,a,b,dis;
scanf("%d%d%d",&w,&a,&b);
if(a+w<=b || a>=b+w)
{
if(a<b){dis=b-(a+w);}
else{dis=a-(b+w);}
}
else{dis=0;}
printf("%d",dis);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void){
int w,a,b,ans;
scanf("%d%d%d",&w,&a,&b);
if(a<=b && b<=(a+w))ans=0;
else if(a+w<b) ans = b-a-w;
else ans=a-b-w;
printf("%d",ans);
return 0;
} |
#include<stdio.h>
#include<math.h>
int main()
{
int answer, W,a,b;
scanf("%d %d %d",&W, &a, &b);
if ((b+W)<=a)
answer = a-(b+W);
else
answer = b-(a+W);
if (answer<0)
answer = 0;
printf("%d",answer);
return 0;
} |
#include <stdio.h>
#include <string.h>
int main(void)
{
int w,a,b;
int dist;
scanf("%d %d %d", &w,&a,&b);
if(b-w>a){
dist=b-a-w;
} else if(b<a-w){
dist=a-b-w;
} else {
dist=0;
}
printf("%d\n",dist);
}
|
#include<stdio.h>
int main()
{
int W,a,b;
int con=0;
scanf("%d %d %d",&W,&a,&b);
while(b>W+a||b+W<a){
if(b>W+a) {
b--;
con++;
}
else if(b+W<a){
b++;
con++;
}
}
printf("%d",con);
return 0;
} |
#include<stdio.h>
int main()
{
int a,b,w,flag;
while(scanf("%d%d%d",&w,&a,&b)!=EOF)
{
if(b>a+w) flag=b-a-w;
if(b+w<a) flag=a-b-w;
if(a==(b+w)||(a+w)==b) flag=0;
if(a<=b&&b<=a+w) flag=0;
if(a<=b+w&&b<=a) flag=0;
printf("%d\n",flag);
}
}
|
#include<stdio.h>
int main(void){
int W,a,b,ans;
scanf("%d %d %d",&W,&a,&b);
if(a<=b){
if(a+W>=b){
ans=0;
}
else{
ans=b-(a+W);
}
}
else{
if(b+W>=a){
ans=0;
}
else{
ans=a-(b+W);
}
}
printf("%d\n",ans);
return 0;
} |
//b.c
#include <stdio.h>
int main(){
int W,a,b;
scanf("%d %d %d",&W,&a,&b);
if(b < a){
int t = b;
b = a;
a = t;
}
int moves = b-a-W;
if(moves < 0) moves = 0;
printf("%d\n",moves);
return 0;
} |
#include<stdio.h>
int main()
{
int a,b,W;
scanf("%d %d %d",&W,&a,&b);
if((a+W >= b && a+W <= b+W) || (a >= b && b+W >= a))
printf("0\n");
else
printf("%d\n", b-a-W > a-b-W ? (a-b-W > 0 ? a-b-W : b-a-W) :(b-a-W>0 ? b-a-W : a-b-W));
return 0;
}
|
#include <stdio.h>
int main(void){
int w,a,b;
int r1r,r1l,r2r,r2l;
scanf("%d%d%d",&w,&a,&b);
r1l=a; r1r=a+w;
r2l=b; r2r=b+w;
if(r1r<r2l) printf("%d\n",r2l-r1r);
else if(r1l>r2r) printf("%d\n",r1l-r2r);
else printf("0\n");
return 0;
} |
int main(void){
int w, a, b;
scanf("%d%d%d", &w, &a, &b);
if (w + a < b) {
printf("%d\n", b - (a + w));
goto end;
}
if (b + w < a) {
printf("%d\n", a - (b + w));
goto end;
}
puts("0");
end:
return 0;
}
|
#include <stdio.h>
int main(void)
{
int w;
int a;
int b;
scanf("%d%d%d",&w,&a,&b);
if(!((a<=b&&b<=a+w)||(b+w>=a&&b+w<=a+w))){
if(b+w<a){
printf("%d\n",a-(b+w));
}
if(b>a+w){
printf("%d\n",b-(a+w));
}
}else{
printf("0\n");
}
return 0;
} |
#include<stdio.h>
int main(void){
long a,b,w,s;
scanf("%ld %ld %ld",&w,&a,&b);
if(b<a+w){
s=a-(b+w);
if(s>0){
printf("%ld",s);
}else{
printf("0");
}
}else if(b>a+w){
s=b-(a+w);
printf("%ld",s);
}else{
printf("0");
}
return 0;
} |
#include<stdio.h>
int zt(int x){if(x > 0){return x;}return -x;}
int minim(int x,int y){if(x < y){return x;}return y;}
int main(void){
int w,a,b;
scanf("%d%d%d",&w,&a,&b);
if(a <= b+w && b <= a+w){printf("0\n");return 0;}
printf("%d\n",minim(zt(b-a-w),zt(a-b-w)));
return 0;
} |
#include <stdio.h>
#define MAX(a,b) ((a < b) ? b : a)
int main(void) {
int W, a, b;
scanf("%d %d %d", &W, &a, &b);
int X = 0;
if(a < b) {
int a_e = a + W;
X = MAX(0, b - a_e);
} else if(a > b) {
int b_e = b + W;
X = MAX(0, a - b_e);
}
printf("%d\n", X);
return 0;
}
|
#include<stdio.h>
int main()
{
int w,a,b,max,min,minl,minr,maxl,maxr;
scanf("%d %d %d",&w,&a,&b);
if(a > b)
max = a,min = b;
else
max = b,min = a;
maxr = max + w;
maxl = max;
minr = min + w;
minl = min;
if(maxr - minl <= 2 * w)
printf("0\n");
else
printf("%d\n",maxl - minr);
return 0;
}
|
#include <stdio.h>
int main(int argc, char const *argv[])
{
int a ,b ,W;
scanf("%d %d %d",&W,&a,&b);
if(a+W >= b && a <= b ){
printf("0\n");
}
else if(a+W >= b+W && a <= b+W ){
printf("0\n");
}
else{
if(b > a+W){
printf("%d\n",b - (a+W) );
}
else if(b+W < a){
printf("%d\n",a - (b+W) );
}
}
return 0;
} |
#include <stdio.h>
int main() {
int width, point_a, point_b;
scanf("%d %d %d", &width, &point_a, &point_b);
if(point_a > point_b) {
int temp = point_a;
point_a = point_b;
point_b = temp;
}
if(point_a + width >= point_b) {
printf("0\n");
} else {
printf("%d\n", point_b - width - point_a);
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
int w,a,b,a2,b2,s;
while(scanf("%d%d%d",&w,&a,&b)!=EOF)
{
a2=a+w;
b2=b+w;
if (b>a2) s=b-a2;
else if (b<=a2&&b>=a) s=0;
else if (b2<=a2&&b2>=a) s=0;
else if (b2<a) s=a-b2;
printf("%d\n",s);
}
return 0;
} |
#include<stdio.h>
int main()
{
int W,a,b,c,d,e,f;
scanf("%d %d %d",&W,&a,&b);
c=a+W;
d=0;
if(c>=b&&a<=b||(b+W)>=a&&(a+W)>=(b+W))
printf("%d\n",d);
if(b>c)
{
e=b-c;
printf("%d",e);
}
if((b+W)<a)
{
f=a-(b+W);
printf("%d",f);
}
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int w, a,b;
int s1,s2;
scanf("%d%d%d",&w,&a,&b);
if(b>=a)
{
s1=a+w;
if((b-s1)>=1)
printf("%d\n",b-s1);
else printf("0\n");
}
else
{
s2=b+w;
if(s2>=a)
printf("0\n");
else
printf("%d\n",a-s2);
}
return 0;
} |
#include<stdio.h>
int main()
{
int w,a,b,t;
while(scanf("%d%d%d",&w,&a,&b)==3)
{
if(a>=b)
{
t=a-w-b;
if(t>0)
printf("%d\n",t);
else printf("0\n");
}
else {
t=b-w-a;
if(t>0)
printf("%d\n",t);
else printf("0\n");
}
}
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int main(void){
int W,a,b,distance;
scanf("%d %d %d",&W,&a,&b);
if((a <= b && b <= (a+W)) || (b <= a && a <= (b+W))){
distance = 0;
}else{
if(abs(b-(a+W)) < abs(a-(b+W))){
distance = abs(b-(a+W));
}else{
distance = abs(a-(b+W));
}
}
printf("%d",distance);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int main()
{
int W;
int a;
int b;
int out;
scanf("%d %d %d",&W,&a,&b);
if(a<=b)
{
out = -1*(a+W-b);
}else{
out = -1*(b+W-a);
}
if(out<=0)
{
printf("0\n");
}else{
printf("%d\n",out);
}
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int cmp(const void *a,const void *b){
if(*(int*)a>*(int*)b){return -1;}
else if(*(int*)a<*(int*)b){return 1;}
else {return 0;}
}
int min(int a,int b){
if(a>=b){return b;}
return a;
}
int main(void){
int w,a,b;
scanf("%d %d %d",&w,&a,&b);
int aa,aw,bb,bw;
aa=a;
aw=a+w;
bb=b;
bw=b+w;
if(b<=aw&&aw<=bw){printf("0\n");return 0;}
printf("%d",min(abs(bb-aw),abs(bw-a)));
} |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main(void){
int width;
int a,b;
// printf("Input the width of square:");
scanf("%d",&width);
// printf("Input the x coodinates of the under square:");
scanf("%d",&a);
//printf("Input the x coodinates of the upper square:");
scanf("%d",&b);
if(a<=b&&b<=a+width){
printf("0");
}
else if(b<=a&&a<=b+width){
printf("0");
}
else if(a+width<b){
printf("%d",b-(a+width));
}
else if(b+width<a){
printf("%d",a-(b+width));
}
return 0;
} |
main(x){scanf("%d",&x);printf("%.f",sqrt(x*2));} |
n;main(x){for(scanf("%d",&x);x>0;)x-=++n;printf("%d",n);} |
i;
main(a){
scanf("%d",&a);
for(i;a-i>0;){
a-=i++;
}
printf("%d\n",i);
}
|
#include<stdio.h>
int main(){
long long int x;
scanf("%lld",&x);
long long i=1,sum=1;
while(1){
if(i*(i+1)/2>=x)break;
i++;
}
printf("%lld",i);
return 0;
} |
#include<stdio.h>
int main()
{
int x,i,k;
while(scanf("%d",&x)!=EOF)
{
k=0;
for(i=0;;i++)
{
k=k+i;
if(k>=x) {printf("%d\n",i);break;}
}
}
}
|
#include <stdio.h>
int main(void){
long X;
scanf("%ld",&X);
long x = 0,cnt = 0;
while(x < X){
x += cnt;
cnt++;
}
printf("%ld\n",cnt-1);
return 0;
} |
#include <stdio.h>
#include <math.h>
int main(void)
{
long X;
scanf("%ld", &X);
long t = (long)(-1+sqrt(8*X+1))/2;
while(t*(t+1) < X*2)
t++;
printf("%ld\n", t);
} |
#include <stdio.h>
int main(){
int X;
scanf("%d",&X);
if(X<0){X=-X;}
int t=0;
int sum=0;
while(1){
if(sum>=X){break;}
t++;
sum+=t;
}
printf("%d\n",t);
return 0;
} |
#include<stdio.h>
#define FOR(i,a,b) for(int i=a;i<b;i++)
int main(){
int x,sum = 0;
scanf("%d",&x);
FOR(i,1,1000000000){
sum += i;
if(x <= sum){
sum = i;
break;
}
}
printf("%d\n",sum);
} |
#include <stdio.h>
int main(void) {
long x;
scanf("%ld", &x);
long sum = 0;
for (long i = 1; i <= x; i++) {
sum += i;
if (sum >= x) {
printf("%ld\n", i);
break;
}
}
return 0;
} |
#include <stdio.h>
#include <math.h>
int main()
{
int X;
scanf("%d", &X);
int ans = (int)(sqrt((double)X * 2));
for (; ans * (ans + 1) / 2 >= X; ans--);
printf("%d\n", ans + 1);
fflush(stdout);
return 0;
} |
#include <stdio.h>
int main()
{
int x,i,a;
while(scanf("%d",&x)==1)
{
a=0;
for(i=1;;i++)
{
a+=i;
if(a>=x)break;
}
printf("%d\n",i);
}
return 0;
}
|
#include<stdio.h>
int main(void){
long long int X,ans,upp=123456,low=0;
scanf("%lld",&X);
while(upp-low!=1){
ans=(upp+low)/2;
if(((ans*(ans-1))/2)>=X){
upp=ans;
} else{
low=ans;
}
}
printf("%lld\n",low);
return 0;
} |
#include<stdio.h>
int main()
{
long int n=2000000;
long long int a[n],ans,i,x;
scanf("%lld",&x);
for(i=0;i<n;++i)
{
a[i]=(i*(i+1))/2;
}
for(i=0;i<n;++i)
{
if(a[i]<x && a[i+1]>=x) ans=i+1;
}
printf("%d",ans);
return 0;} |
#include <stdio.h>
#include <math.h>
int main()
{
long long int ans,sum,i;
scanf("%lld",&ans);
for( i=1;;i++)
{
if((1+i)*i/2>=ans)
{
sum=(i+1)*i/2;
break;
}
}
printf("%lld",i);
} |
#include <stdio.h>
#include <stdint.h>
int main(void) {
int64_t X;
scanf("%ld", &X);
int64_t DIST = 0;
int64_t TIME = 1;
for(TIME = 1; TIME < X; TIME++) {
DIST += TIME;
if(DIST >= X)
break;
}
printf("%ld\n", TIME);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int main()
{
long long x,ans,l=0,r=200000,mid;
scanf("%lld",&x);
x=x>=0?x:-x; //正负等价
//∑ans>=x的最小ans即为答案 即ans(ans+1)/2=x
while(l<=r){ //数据量大二分查找
mid=(l+r)/2;
if(mid*(mid+1)/2>=x) r=mid-1;
else l=mid+1;
}
ans=l;
printf("%lld\n",ans);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
long long w,s,i;
while(scanf("%lld",&w)!=EOF)
{
i=1;
s=0;
while(i<=w)
{
s++;
w-=i;
i++;
}
if (w!=0) s++;
printf("%lld\n",s);
}
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main(){
unsigned long long X;
double m;
unsigned long long out;
double temp;
scanf("%llu",&X);
m = 0.5*(-1.0 + sqrt(1.0+8.0*X));
out = m;
temp = out;
if( temp < m) out++;
printf("%llu\n",out);
return 0;
} |
//Go home
#include<stdio.h>
typedef long long int ll;
ll MIN(ll a, ll b){return a>b?b:a;}
int main(void){
ll x;
scanf("%lld", &x);
ll s[100001];
s[0] = 0;
for(int i=1; i<100001; i++){
s[i] = s[i-1] + i;
}
int s_idx = 0;
while(s[s_idx] < x){
s_idx += 1;
}
printf("%lld\n", s_idx);
return 0;
} |
#include <stdio.h>
#include <inttypes.h>
int main(void) {
uint64_t X;
uint64_t ng, ok;
if (scanf("%" SCNu64, &X) != 1) return 1;
ng = 0;
ok = X;
while (ng + 1 < ok) {
uint64_t mid = ng + (ok - ng) / 2;
if (mid * (mid + 1) / 2 >= X) ok = mid; else ng = mid;
}
printf("%" PRIu64 "\n", ok);
return 0;
}
/*
フルスピードで右に向かう
通り過ぎたなら、そこまでのなかでどれか1個のジャンプをスキップすればおｋ
*/
|
#include<stdio.h>
int main(){
int n,k,i,j,l,g,c=0;
int a[5001],dp1[5001][5001],dp2[5001][5001];
scanf("%d%d",&n,&k);
for(i=0;i<n;i++)scanf("%d",&a[i]);
for(i=0;i<=n;i++)for(j=0;j<=k;j++)dp1[i][j]=dp2[i][j]=0;
dp1[0][0]=dp2[n][0]=1;
for(i=0;i<n;i++)for(j=0;j<=k;j++)dp1[i+1][j]=dp1[i][j]|(j<a[i]?0:dp1[i][j-a[i]]);
for(i=n;i>0;i--)for(j=0;j<=k;j++)dp2[i-1][j]=dp2[i][j]|(j<a[i-1]?0:dp2[i][j-a[i-1]]);
for(i=0;i<n;i++){
g=l=0;
for(j=k-1;j>=0;j--){l+=dp2[i+1][k-j-1];if(k-j>a[i])l-=dp2[i+1][k-a[i]-j-1];g|=dp1[i][j]*l;}
if(a[i]<k&&!g)c++;
}
printf("%d",c);
}
|
#include<stdio.h>
#include<stdlib.h>
#include<stdint.h>
#include<inttypes.h>
#include<string.h>
typedef int32_t i32;
void trans(uint8_t *dp,i32 k,i32 a){
for(i32 i=k-1;i>=a;i--){
dp[i]|=dp[i-a];
}
}
i32 calc(i32 *a,i32 n,uint8_t *dp,i32 k){
if(n==1){
i32 v=a[0];
if(v>=k) return 0;
for(i32 i=k-v;i<k;i++) if(dp[i]) return 0;
return 1;
}
i32 m=n/2;
uint8_t *save=(uint8_t *)calloc(k,sizeof(uint8_t));
memcpy(save,dp,sizeof(uint8_t)*k);
for(i32 i=m;i<n;i++) trans(dp,k,a[i]);
i32 p=calc(a,m,dp,k);
memcpy(dp,save,sizeof(uint8_t)*k);
free(save);
for(i32 i=0;i<m;i++) trans(dp,k,a[i]);
return p+calc(a+m,n-m,dp,k);
}
void run(void){
i32 n,k;
scanf("%" SCNi32 "%" SCNi32,&n,&k);
i32 *a=(i32 *)calloc(n,sizeof(i32));
for(i32 i=0;i<n;i++) scanf("%" SCNi32,a+i);
uint8_t *dp=(uint8_t *)calloc(k,sizeof(uint8_t));
dp[0]=1;
i32 ans=calc(a,n,dp,k);
printf("%" PRIi32 "\n",ans);
}
int main(void){
run();
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int less(const void* a, const void* b){
return *(int*)a - *(int*)b;
}
int is_no_need(int i, const int* a, int K, int N){
int dp[K];
for(int k = 0; k < K; k++) dp[k] = 0;
for(int j = 1; j <= N; j++){
for(int k = K - 1; k >= 0; k--){
if(j != i && a[j] <= k && dp[k - a[j]] + a[j] > dp[k])
dp[k] = dp[k - a[j]] + a[j];
}
}
return dp[K - 1] + a[i] < K;
}
int count_no_need(const int* a, int K, int N){
//不必要でないカードのうち, 書かれた数が最小であるもの
int need = N + 1;
//不必要であるカードのうち, 書かれた数が最大であるもの
int no_need = 0;
while(need - no_need > 1){
int i = (need + no_need) / 2;
if(is_no_need(i, a, K, N)) no_need = i;
else need = i;
}
return no_need;
}
int main(){
int N, K;
scanf(" %d %d ", &N, &K);
int a[N + 1];
a[0] = 0;
for(int i = 1; i <= N; i++) scanf(" %d ", a + i);
qsort(a, N + 1, sizeof(int), less);
printf("%d\n", count_no_need(a, K, N));
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#define F 1
//const int mod[F]={1000000009,1000000021,1000000033,1000000087};
const int mod[F]={5077};
typedef struct hashNode{
int hash[F];
} node;
node add(node a,node b){
node x;
for(int i=0;i<F;i++){
x.hash[i]=(a.hash[i]+b.hash[i])%mod[i];
}
return x;
}
node minus(node a,node b){
node c;
for(int i=0;i<F;i++){
c.hash[i]=(a.hash[i]-b.hash[i]+mod[i])%mod[i];
}
return c;
}
int isZero(node a){
for(int i=0;i<F;i++) if(a.hash[i]>0) return 0;
return 1;
}
void run(void){
int n,k;
scanf("%d%d",&n,&k);
int *a=(int *)calloc(n,sizeof(int));
int i,j;
for(i=0;i<n;i++) scanf("%d",a+i);
node *dp=(node *)calloc(k,sizeof(node));
for(i=0;i<F;i++) dp[0].hash[i]=1;
for(i=0;i<n;i++){
for(j=k-1;j-a[i]>=0;j--){
dp[j]=add(dp[j],dp[j-a[i]]);
}
}
node *dp2=(node *)calloc(k,sizeof(node));
int ans=0;
for(i=0;i<n;i++){
if(a[i]>=k) continue;
for(j=0;j<a[i];j++) dp2[j]=dp[j];
for(j=a[i];j<k;j++){
dp2[j]=minus(dp[j],dp2[j-a[i]]);
}
for(j=k-1;j>=k-a[i];j--) if(!isZero(dp2[j])) break;
if(j<k-a[i]) ans++;
}
printf("%d\n",ans);
}
int main(void){
run();
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int min(int a, int b){
if(a < b){
return a;
}
else{
return b;
}
}
int main(){
int N, K, i, j;
scanf("%d%d", &N, &K);
int *a = (int *)malloc(sizeof(int) * N);
int inf = N;
for(i = 0; i < N; i++){
scanf("%d", &a[i]);
}
int *inc = (int *)malloc(sizeof(int) * K);
int *dec = (int *)malloc(sizeof(int) * K);
for(i = 1; i < K; i++){
inc[i] = inf;
dec[i] = inf;
}
inc[0] = -1;
dec[0] = -1;
int sum = 0;
for(i = 0; i < N; i++){
sum = min(sum + a[i], K - 1);
for(j = sum; j >= a[i]; j--){
if(inc[j - a[i]] != inf && inc[j] == inf){
inc[j] = i;
}
}
}
sum = 0;
for(i = N - 1; i >= 0; i--){
sum = min(sum + a[i], K - 1);
for(j = sum; j >= a[i]; j--){
if(dec[j - a[i]] != inf && dec[j] == inf){
dec[j] = i;
}
}
}
int need = 0, k, l;
for(i = 0; i < N; i++){
for(k = 0, l = K - 1;;){
while(inc[k] >= i){
k++;
if(k >= K){
break;
}
}
while((dec[l] <= i || dec[l] == inf) && dec[l] != -1){
l--;
if(l < 0){
break;
}
}
if(k >= K || l < 0 ){
break;
}
if(k + l < K - a[i]){
k++;
}
else if(k + l >= K){
l--;
}
else{
need++;
break;
}
}
}
printf("%d\n", N - need);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) > (b) ? (b) : (a))
#define abs(x) ((x) > 0 ? (x) : -(x))
#define MOD 1000000007 //10^9 + 7
#define endl printf("\n")
typedef long long ll;
#define MAX_N (1 << 17)
bool sdp[5010][5010], gdp[5010][5010];
int
main(int argc, const char *argv[])
{
int n, k, a[5010];
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sdp[0][0] = true;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= k; j++) {
sdp[i + 1][j] = sdp[i][j];
if (j - a[i] >= 0) sdp[i + 1][j] |= sdp[i][j - a[i]];
}
}
gdp[n + 1][0] = true;
for (int i = n - 1; i >= 0; i--) {
for (int j = 0; j <= k; j++) {
gdp[i + 1][j] = gdp[i + 2][j];
if (j - a[i] >= 0) gdp[i + 1][j] |= gdp[i + 2][j - a[i]];
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int x = 0; int d[5001];
for (int j = 0; j <= k; j++) {
if (gdp[i + 1][j]) d[x++] = (ll)j;
}
for (int j = 0; j <= k; j++) {
if (sdp[i - 1][j]) {
ll mi = (ll)k - (ll)a[i - 1] - (ll)j, ma = (ll)(k - 1 - j);
int l1 = -1, r1 = x - 1, med;
if (mi <= 0) r1 = 0;
if (mi > (ll)d[x - 1]) continue;
if (mi > 0) {
while (r1 - l1 > 1) {
med = (r1 + l1) / 2;
if ((ll)d[med] >= mi) r1 = med;
else l1 = med;
}
}
int l2 = 0, r2 = x;
if (ma < 0) continue;
else if (ma >= d[x - 1]) l2 = x - 1;
else {
while (r2 - l2 > 1) {
med = (r2 + l2) / 2;
if ((ll)d[med] <= ma) l2 = med;
else r2 = med;
}
}
if (l2 - r1 >= 0) {
ans++; break;
}
}
}
}
printf("%d\n", n - ans);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#define BUFFER_MAX 100
int cmp(const void* x, const void* y) {
int a = *(const int*)x, b = *(const int*)y;
if (a < b) return -1;
return a > b;
}
int N, K;
int a[8192];
int cardNum;
int cards[8192];
uint64_t canMake[2][BUFFER_MAX];
void merge(uint64_t* dest, const uint64_t* src, int offset) {
int deltaIndex = offset / 64;
int shift = offset % 64;
int i;
for (i = 0; i < BUFFER_MAX; i++) {
dest[i] = src[i];
}
if (shift == 0) {
for (i = deltaIndex; i < BUFFER_MAX; i++) {
dest[i] |= src[i - deltaIndex];
}
} else {
dest[deltaIndex] |= src[0] << shift;
for (i = deltaIndex + 1; i < BUFFER_MAX; i++) {
dest[i] |= ((src[i - deltaIndex] << shift) | (src[i - deltaIndex - 1] >> (64 - shift)));
}
}
}
/* [min, max) */
int exists(const uint64_t* data, int min, int max) {
int minIndex = min / 64;
int minShift = min % 64;
int maxIndex = max / 64;
int maxShift = max % 64;
uint64_t minMask = (~UINT64_C(0)) << minShift;
uint64_t maxMask = (~UINT64_C(0)) << maxShift;
if (minIndex == maxIndex) {
uint64_t mask = minMask & ~maxMask;
return (data[minIndex] & mask) != 0;
} else {
int i;
if ((data[minIndex] & minMask) != 0) return 1;
for (i = minIndex + 1; i < maxIndex; i++) {
if (data[i] != 0) return 1;
}
if ((data[maxIndex] & ~maxMask) != 0) return 1;
return 0;
}
}
int isFuhituyou(const int* cards, int syugoNum, int targetIndex) {
int i;
int current = 0;
for (i = 0; i < BUFFER_MAX; i++) {
canMake[current][i] = 0;
}
canMake[current][0] = 1;
for (i = 0; i < syugoNum; i++) {
if (i != targetIndex) {
merge(canMake[1 - current], canMake[current], cards[i]);
current = 1 - current;
}
}
return !exists(canMake[current], K - cards[targetIndex], K);
}
int main(void) {
int i;
int sum = 0;
int yes, no;
if (scanf("%d%d", &N, &K) != 2) return 1;
cardNum = 0;
for (i = 0; i < N; i++) {
if (scanf("%d", &a[i]) != 1) return 1;
if (a[i] < K) {
cards[cardNum++] = a[i];
if (sum < K) sum += a[i];
}
}
if (sum < K) {
/* K未満のカードをすべて足してもK未満 → 全て不必要である */
printf("%d\n", cardNum);
return 0;
}
qsort(cards, cardNum, sizeof(*cards), cmp);
/* 最初が不必要でない → 全て不必要でない */
if (!isFuhituyou(cards, cardNum, 0)) {
puts("0");
return 0;
}
yes = 0;
no = cardNum;
while (yes + 1 < no) {
int mid = yes + (no - yes) / 2;
if (isFuhituyou(cards, cardNum, mid)) yes = mid; else no = mid;
}
printf("%d\n", yes + 1);
return 0;
}
/*
K以上のカード → 単体でよい集合 → 判定に関係ない (不必要なカードではない)
K未満のカード → aのカードを除いた時、総和がK-a以上K未満になる集合を作れるか？
MAX 5000枚 → 平方分割 72 × 72 程度
各ブロックを除いて作れる数をDP 約5000 × 72
各カードについて、所属するブロックと残りでDP 約72 × 5000
↑1回のDPが5000じゃなくて、5000×5000やんけ＼(^o^)／
仮に一番下のカードaを除いたセットで、総和がK-a以上K未満になる集合を作れるとすると
一番下のカードを加えれば総和がK以上になる → その集合の要素は不必要でない
それ以上のカードを加えても総和がK以上になる → それ以上のカードも不必要でない
作れないなら不必要 (予想)
不必要 → それがあるかによってK以上になるかに影響を与えない → 抜かなくてよい
仮にあるカードが「不必要でない」 → そのカード以上は全て不必要でない
(不必要でない根拠の集合を構成 or そのカードの代わりに「よい集合」にできる ため)
仮にあるカードが「不必要」→ そのカード以下は全て不必要
(そのカード以下に不必要でないカードがあると、上に矛盾するため)
「不必要でない」かの判定 → そのカードを除いてDPでK-a以上K未満にできるか
ビット演算による定数倍高速化：5000×5000 → 5000×80くらい (64倍)
不必要 or notの二分探索
*/
|
#include <stdio.h>
int main(){
int X,i,s=0;
scanf("%d",&X);
if(X<0)X*=-1;
for(i=0;s<X;i++)s+=i+1;
printf("%d",i);
return 0;
} |
#include <stdio.h>
int main(void)
{
int zahyou = 0, x, i ;
scanf("%d", &x);
for(i = 0; zahyou < x ; i++) zahyou += i;
printf("%d\n", i - 1);
return 0;
} |
#include<stdio.h>
int main(int argc, char const *argv[]){
long x,len=0,i=0;
scanf("%ld",&x);
while(len<x){
i++;
len+=i;
}
printf("%ld\n",i);
return 0;
} |
#include <stdio.h>
int main(int argc, char const *argv[])
{
int X;
int x=0;
int i=0;
scanf("%d",&X);
while(x*(x+1)/2<X) x++;
printf("%d\n",x );
return 0;
} |
#include <stdio.h>
main(){
long long a;
scanf("%d",&a);
long long x= 8*a+1;
long long i=0;
while(i*i<x){
i++;
}
printf("%lld\n",i/2);
}
|
#include<stdio.h>
int sankaku(int x){return (x*(x+1))/2;}
int main(void){
int i,x;
scanf("%d",&x);
for(i = 1;i <= 100000;i++){
if(x <= sankaku(i)){printf("%d\n",i);return 0;}
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
long long i, X;
scanf("%lld", &X);
for (i=1LL;;i++) {
if (X<=i*(i+1LL)/2LL) break;
}
printf("%lld\n", i);
return 0;
} |
#include<stdio.h>
//Regular 070 C
int main(){
int X, x;
int point = 0;
x = 1;
scanf("%d", &X);
while(point<=X){
point += x;
x++;
}
point -= x-1;
if(point==X) printf("%d\n",x-2);
else printf("%d\n", x-1);
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define NITEM(arr) (sizeof(arr)/sizeof(arr[0]))
typedef int (*cmp_t)(const void *, const void *);
int main(void)
{
int X, i;
while(scanf("%d", &X)==1)
{
for(i=1;i*(i+1)/2<X;i++)
;
printf("%d\n", i);
}
return 0;
}
|
#include <stdio.h>
int main() {
long long x;
long long s, e, m;
scanf("%lld", &x);
s = 1;
e = 100000;
//printf("[%d]\n", e);
while(s < e) {
m = (s + e) / 2;
if(m * (m + 1) / 2 < x) s = m + 1;
else e = m;
}
printf("%lld\n", s);
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int calc(int *a,int n,int k,char *dp){
if(n==1){
if(a[0]>=k) return 0;
for(int i=k-1;i>=k-a[0];i--) if(dp[i]) return 0;
return 1;
}
int m=n/2;
char *save=(char *)calloc(k,sizeof(char));
memcpy(save,dp,k);
int i,j;
for(i=m;i<n;i++){
if(a[i]>=k) continue;
for(j=k-1;j>=a[i];j--) dp[j]|=dp[j-a[i]];
}
int cnt=calc(a,m,k,dp);
memcpy(dp,save,k);
free(save);
for(i=0;i<m;i++){
if(a[i]>=k) continue;
for(j=k-1;j>=a[i];j--) dp[j]|=dp[j-a[i]];
}
cnt+=calc(a+m,n-m,k,dp);
return cnt;
}
void run(void){
int n,k;
scanf("%d%d",&n,&k);
int *a=(int *)calloc(n,sizeof(int));
for(int i=0;i<n;i++) scanf("%d",a+i);
char *dp=(char *)calloc(k,sizeof(char));
dp[0]=1;
int ans=calc(a,n,k,dp);
printf("%d\n",ans);
}
int main(void){
run();
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#define swap(type,a,b) do{type t=a;a=b;b=t;}while(0);
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define ll long long
#define INF 100000000
#define FOR(i,a,n) for(i=(a);i<(n);i++)
int comp(const void* a,const void* b){
return *(int*)a-*(int*)b;
}
void fill(int a[],int b,int c){
int i;
FOR(i,0,b) a[i]=c;
return;
}
int a[5000];
int dp[5000];
int n,k;
int check(int x){
int i,j;
if(a[x]>=k) return 1;
FOR(i,1,k) dp[i]=0;
dp[0]=1;
FOR(i,0,n){
if(i!=x&&a[i]<k){
for(j=k-a[i];j>=0;j--){
if(dp[j]) dp[j+a[i]]=1;
}
}
}
FOR(i,k-a[x],k){
if(dp[i]) return 1;
}
return 0;
}
int main(void)
{
int i,l,r,mid;
scanf("%d%d",&n,&k);
FOR(i,0,n) scanf("%d",&a[i]);
qsort(a,n,sizeof(int),comp);
l=-1,r=n;
while(r-l>1){
mid=(l+r)/2;
if(check(mid)) r=mid;
else l=mid;
}
printf("%d\n",l+1);
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
int sortfnc(const void *a,const void *b){
if(*(long long*)a == *(long long*)b){return 0;}
if(*(long long*)a > *(long long*)b){return -1;}
return 1;
}
int main(void){
long long i,j,n,k,a[8192],sum=0,jud,dp[8192];
long long s,f,mem;
scanf("%lld%lld",&n,&k);
for(i = 0;i < n;i++){scanf("%lld",&a[i]);sum+=a[i];}
if(sum < k){printf("%d\n",n);return 0;}
if(sum == k){printf("0\n");return 0;}
qsort(a,n,sizeof(long long),sortfnc);
s = 0;f = n-1;
while(s<=f){
jud = (s+f)/2;
if(a[jud] >= k){s = jud+1;continue;}
for(i = 0;i <= 8191;i++){dp[i] = 0;}
for(i = 0;i < n;i++){
mem = a[i];
if(i == jud){continue;}
if(mem >= k){continue;}
for(j = k-1;j > 0;j--){
if(dp[j] == 1){
if(j+mem < k){dp[j+mem] = 1;}
}
}
dp[mem] = 1;
}
mem = a[jud];
for(i = k-1;i >= k-mem;i--){
if(dp[i] == 1){s = jud+1;break;}
if(i == k-mem){f = jud-1;break;}
}
}
printf("%d\n",n-s);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
int comp(const void *p1, const void *p2) {
return *(const int *)p1 - *(const int*)p2;
}
int needs(int);
int N, K, a[5010];
int dp[5010][5010];
int main(void) {
int i, left, right, center;
scanf("%d%d", &N, &K);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
// 解に関係ない値は読み飛ばす
if (a[i] >= K) {
N--;
i--;
}
}
qsort(a, N, sizeof(int), comp);
// 二分探索で解を探す
left = 0; right = N - 1;
while (left <= right) {
center = (left + right) / 2;
if (needs(center))
right = center - 1;
else
left = center + 1;
}
printf("%d\n", left);
return 0;
}
int needs(int index) {
int i, j;
// 最初と飛ばすの行のみ初期化
for (j = 0; j < K; j++) {
dp[0][j] = 0;
dp[index][j] = 0;
}
if (index != 0) dp[0][a[0]] = 1;
dp[0][0] = 1;
for (i = 1; i < N; i++) {
for (j = 0; j < K; j++) {
dp[i][j] = dp[i - 1][j];
if (i != index && j - a[i] >= 0)
dp[i][j] |= dp[i - 1][j - a[i]];
}
}
for (j = K - a[index]; j < K; j++) {
if (dp[N - 1][j] == 1)
return 1;
}
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
typedef long long int int64;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define POS(i,j) ((i)*k+(j))
void run(void){
int n,k;
scanf("%d%d",&n,&k);
int *a=(int *)malloc(sizeof(int)*n);
int i;
for(i=0;i<n;i++) scanf("%d",a+i);
char *front=(char *)calloc(k*(n+1),sizeof(char));
front[POS(0,0)]=1;
for(i=0;i<n;i++){
int j;
for(j=0;j<k;j++) front[POS(i+1,j)]=front[POS(i,j)];
for(j=k-1;j>=a[i];j--){
if(front[POS(i,j-a[i])]==0) continue;
front[POS(i+1,j)]=1;
}
}
char *back=(char *)calloc(k*(n+1),sizeof(char));
back[POS(n,0)]=1;
for(i=n-1;i>=0;i--){
int j;
for(j=0;j<k;j++) back[POS(i,j)]=back[POS(i+1,j)];
for(j=k-1;j>=a[i];j--){
if(back[POS(i+1,j-a[i])]==0) continue;
back[POS(i,j)]=1;
}
}
int ans=n;
for(i=0;i<n;i++){
int l,r;
l=0;
r=k-1;
while(l<k && r>=0){
while(l<k && front[POS(i,l)]==0) l++;
while(r>=0 && back[POS(i+1,r)]==0) r--;
if(l<k && r>=0 && l+r<k && l+r+a[i]>=k){
ans--;
break;
} else if(l+r>=k){
r--;
} else {
l++;
}
}
}
printf("%d\n",ans);
}
int main(void){
run();
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
typedef unsigned long long int uint64;
typedef struct bitSetBy64bit{
uint64 *a;
int len;
int n;
} bitSet;
const int bitSet_numOfBit=64;
bitSet* newBitSet(int n){
bitSet *res=(bitSet *)malloc(sizeof(bitSet));
res->a=(uint64 *)calloc((n+bitSet_numOfBit-1)/bitSet_numOfBit,sizeof(uint64));
res->len=(n+bitSet_numOfBit-1)/bitSet_numOfBit;
res->n=n;
return res;
}
void freeBitSet(bitSet *b){
free(b->a);
free(b);
return;
}
inline void fix(bitSet *b){
if(b->n%bitSet_numOfBit!=0) b->a[b->len-1]&=(((uint64)1)<<(b->n%bitSet_numOfBit))-1;
}
void setBitSet(bitSet *b){
const uint64 t=~((uint64)0);
int i;
for(i=0;i<b->len;i++) b->a[i]=t;
fix(b);
return;
}
void clearBitSet(bitSet *b){
const uint64 t=0;
int i;
for(i=0;i<b->len;i++) b->a[i]=t;
return;
}
void flipBitSet(bitSet *b){
int i;
for(i=0;i<b->len;i++) b->a[i]=~b->a[i];
fix(b);
return;
}
int getAtBitSet(bitSet *b,int index){
assert(0<=index && index<b->n);
return (b->a[index/bitSet_numOfBit]>>(index%bitSet_numOfBit))&0x01;
}
void setAtBitSet(bitSet *b,int index){
assert(0<=index && index<b->n);
uint64 t=b->a[index/bitSet_numOfBit];
b->a[index/bitSet_numOfBit]=t|(((uint64)1)<<(index%bitSet_numOfBit));
return;
}
void clearAtBitSet(bitSet *b,int index){
assert(0<=index && index<b->n);
uint64 t=b->a[index/bitSet_numOfBit];
b->a[index/bitSet_numOfBit]=t&(~(((uint64)1)<<(index%bitSet_numOfBit)));
return;
}
void flipAtBitSet(bitSet *b,int index){
assert(0<=index && index<b->n);
uint64 t=b->a[index/bitSet_numOfBit];
b->a[index/bitSet_numOfBit]=t^(((uint64)1)<<(index%bitSet_numOfBit));
return;
}
void assignBitSet(bitSet *x,const bitSet *a){
int i;
for(i=0;i<x->len;i++) x->a[i]=a->a[i];
fix(x);
}
void orBitSet(bitSet *c,const bitSet *a,const bitSet *b){
int i;
for(i=0;i<c->len;i++) c->a[i]=a->a[i]|b->a[i];
fix(c);
return;
}
void andBitSet(bitSet *c,const bitSet *a,const bitSet *b){
int i;
for(i=0;i<c->len;i++) c->a[i]=a->a[i]&b->a[i];
fix(c);
return;
}
void xorBitSet(bitSet *c,const bitSet *a,const bitSet *b){
int i;
for(i=0;i<c->len;i++) c->a[i]=a->a[i]^b->a[i];
fix(c);
return;
}
//x!=a
void leftShiftBitSet(bitSet *x,const bitSet *a,const int c){
assert(c>=0);
clearBitSet(x);
int p=c/bitSet_numOfBit;
int q=c%bitSet_numOfBit;
if(q==0){
int i;
for(i=0;i<x->len-p && i<a->len;i++){
x->a[i+p]=a->a[i];
}
} else {
int i;
for(i=0;i<x->len-p-1 && i<a->len;i++){
uint64 t=a->a[i];
x->a[i+p]|=t<<q;
x->a[i+p+1]|=t>>(bitSet_numOfBit-q);
}
if(i<a->len && i+p<x->len) x->a[i+p]|=a->a[i]<<q;
}
fix(x);
return;
}
int cmp(const void *a,const void *b){
return *(int *)a-*(int *)b;
}
void run(void){
int n,k;
scanf("%u%u",&n,&k);
int *a=(int *)malloc(sizeof(int)*n);
int i;
for(i=0;i<n;i++) scanf("%d",a+i);
qsort(a,n,sizeof(int),cmp);
bitSet *now =newBitSet(k);
bitSet *next=newBitSet(k);
int l=-1;
int r=n;
while(r-l>1){
int m=(l+r)/2;
clearBitSet(now);
setAtBitSet(now,0);
for(i=0;i<n;i++){
if(i==m) continue;
const int aa=a[i];
leftShiftBitSet(next,now,aa);
orBitSet(next,next,now);
bitSet *swap=now;
now=next;
next=swap;
}
for(i=k-1;getAtBitSet(now,i)==0;i--);
if(a[m]+i>=k){
r=m;
} else {
l=m;
}
}
printf("%d\n",l+1);
}
int main(void){
run();
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<stdint.h>
#include<inttypes.h>
#include<assert.h>
typedef uint64_t bitset_val;
typedef struct bitSetBy64bit{
uint64_t *array;
size_t array_len;
size_t num;
} bitset;
bitset* new_bitset (const size_t num) {
bitset *b = (bitset *) calloc (1, sizeof (bitset));
b->num = num;
const size_t bit = sizeof (uint64_t) * 8;
b->array_len = (num + bit - 1) / bit;
b->array = (uint64_t *) calloc (b->array_len, sizeof (uint64_t));
return b;
}
void free_bitset (bitset * const b) {
free (b->array);
free (b);
}
static inline void fix_bitset (bitset * const b) {
if (b->num % (8 * sizeof (uint64_t)) != 0) {
b->array[b->array_len - 1] &= ((uint64_t)1 << (b->num % (8 * sizeof (uint64_t)))) - 1;
}
}
void set_bitset (bitset * const b) {
const uint64_t t = ~(uint64_t)0;
for (size_t i = 0; i < b->array_len; ++i) {
b->array[i] = t;
}
fix_bitset (b);
}
void clear_bitset (bitset * const b) {
const uint64_t t = 0;
for (size_t i = 0; i < b->array_len; ++i) {
b->array[i] = t;
}
}
void flip_bitset (bitset * const b) {
for (size_t i = 0; i < b->array_len; ++i) {
b->array[i] = ~b->array[i];
}
fix_bitset (b);
}
inline int getAt_bitset (const bitset *b, const size_t index) {
assert (0 <= index && index < b->num);
return (b->array[index / (8 * sizeof (uint64_t))] >> (index % (8 * sizeof (uint64_t)))) & 1;
}
inline void setAt_bitset (bitset *const b, const size_t index) {
assert (0 <= index && index < b->num);
b->array[index / (8 * sizeof (uint64_t))] |= (uint64_t)1 << (index % (8 * sizeof (uint64_t)));
}
inline void clearAt_bitset (bitset * const b, const size_t index) {
assert (0 <= index && index < b->num);
b->array[index / (8 * sizeof (uint64_t))] &= ~((uint64_t)1 << (index % (8 * sizeof (uint64_t))));
}
inline void flipAt_bitset (bitset * const b, const size_t index) {
assert (0 <= index && index < b->num);
b->array[index / (8 * sizeof (uint64_t))] ^= (uint64_t)1 << (index % (8 * sizeof (uint64_t)));
}
void assign_bitset (bitset * const x, const bitset * const a) {
assert (x->num >= a->num);
size_t i;
for (i = 0; i < a->array_len; ++i) {
x->array[i] = a->array[i];
}
for (; i < x->array_len; ++i) {
x->array[i] = 0;
}
}
void left_shift_bitset (bitset * const x, const bitset * const a, const size_t shift) {
clear_bitset (x);
size_t p = shift / (8 * sizeof (uint64_t));
size_t q = shift % (8 * sizeof (uint64_t));
if (q == 0) {
for (size_t i = 0; i + p < x->array_len && i < a->array_len; ++i) {
x->array[i + p] = a->array[i];
}
} else {
size_t i;
for (i = 0; i + p + 1 < x->array_len && i + p < a->array_len; ++i) {
uint64_t v = a->array[i];
x->array[i + p] |= v << q;
x->array[i + p + 1] |= v >> ((8 * sizeof (uint64_t)) - q);
}
if (i < a->array_len && i + p < x->array_len) {
x->array[i + p] |= a->array[i] << q;
}
}
fix_bitset (x);
}
typedef uint32_t u32;
void trans (bitset * const b, const u32 a) {
static bitset *tmp = NULL;
if (tmp == NULL) tmp = new_bitset (b->num);
left_shift_bitset (tmp, b, a);
for (size_t i = 0; i < b->array_len; ++i) {
b->array[i] |= tmp->array[i];
}
}
u32 calc (const u32 *a, const u32 n, const u32 k, bitset * const b) {
if (n == 1) {
if (a[0] >= k) return 0;
for (u32 i = k - 1; i >= k - a[0]; --i) {
if (getAt_bitset (b, i)) {
return 0;
}
}
return 1;
}
bitset *save = new_bitset (k);
assign_bitset (save, b);
u32 m = n / 2;
for (u32 i = 0; i < m; ++i) {
trans (b, a[i]);
}
u32 ans = calc (a + m, n - m, k, b);
assign_bitset (b, save);
free_bitset (save);
for (u32 i = m; i < n; ++i) {
trans (b, a[i]);
}
return ans + calc (a, m, k, b);
}
void run (void) {
u32 n, k;
scanf ("%" SCNu32 "%" SCNu32, &n, &k);
u32 *a = (u32 *) calloc (n, sizeof (u32));
for (u32 i = 0; i < n; ++i) {
scanf ("%" SCNu32, a + i);
}
bitset *b = new_bitset (k);
setAt_bitset (b, 0);
u32 ans = calc (a, n, k, b);
printf ("%" PRIu32 "\n", ans);
}
int main (void) {
run ();
return 0;
}
|
int z[9999],r[9999],x;
int f(int a,int b){
fflush(!printf("? %d %d\n",a,b));
scanf("%s",&x);
return x=='Y';
}
int main(){
int a,b,c=0,h,i;
if(scanf("%d%d",&a,&b),a<=b){puts("Impossible");return 0;}
for(i=a+=b;~--i;)!c||f(i,z[c-1])?(z[c++]=i):c--;
for(h=*z,i=a;~--i;)r[i]=f(h,i);
for(printf("! "),i=0;i<a;)printf("%d",r[i++]);
puts("");
} |
#include <stdio.h>
#include <string.h>
#define N 4000
int query(int a, int b) {
static char s[2];
printf("? %d %d\n", a, b), fflush(stdout);
scanf("%s", s);
return s[0] == 'Y';
}
int ds[N];
int find(int i) {
return ds[i] < 0 ? i : (ds[i] = find(ds[i]));
}
void join(int i, int j) {
i = find(i);
j = find(j);
if (i == j)
return;
if (ds[i] > ds[j])
ds[i] = j;
else {
if (ds[i] == ds[j])
ds[i]--;
ds[j] = i;
}
}
int main() {
static int qu[N];
static char cc[N + 1];
int n, a, b, i, cnt;
scanf("%d%d", &a, &b), n = a + b;
if (a <= b) {
printf("Impossible\n");
return 0;
}
memset(ds, -1, n * sizeof *ds);
cnt = 0;
for (i = 0; i < n; i++)
if (cnt == 0)
qu[cnt++] = i;
else if (!query(qu[cnt - 1], i))
cnt--;
else {
if (!query(i, qu[cnt - 1]))
cc[find(qu[0])] = '0', cnt = 0;
else
join(qu[0], i);
qu[cnt++] = i;
}
cc[find(qu[0])] = '1';
for (i = 0; i < n; i++)
if (ds[i] < 0 && !cc[i])
cc[i] = query(qu[0], i) + '0';
for (i = 0; i < n; i++)
cc[i] = cc[find(i)];
printf("! %s\n", cc);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
long t[100000];
int cmp(const void *a,const void *b){
return *(long*)a- *(long*)b;
}
int main(int argc, char const *argv[]){
long n,c,k,i,ans=0,now=-1,mem=0;
scanf("%ld %ld %ld",&n,&c,&k);
for(i=0;i<n;i++){
scanf("%ld",&t[i]);
}
qsort(t,n,sizeof(long),cmp);
for(i=0;i<n;i++){
mem++;
if(now<t[i] || mem>c){
ans++;
now=t[i]+k;
mem=1;
}
}
printf("%ld\n",ans);
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.