stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<cstdio>

#include<iostream>

#include<cstring>



using namespace std;



string str;

int len;



int main(){

	cin>>str;

	len=str.size();

	for (int i=0;i<len;++i){

		if ((i+1)%2==1){

			cout<<str[i];

		}

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.376292031726515x):
#include<stdio.h>

bool x=true;

char c;

int main()

{

	while((c=getchar())!=EOF)

	{

		if(x&1) putchar(c);

		x^=1;

	}

	putchar('\n');

	return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<string>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

int main()

{

	char s[100005];

	scanf("%s",s+1);

	int l=strlen(s+1);

	for(int i=1;i<=l;i+=2)

	{

		printf("%c",s[i]);

	}

	printf("\n");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.376987071354374x):
#include<stdio.h>

bool x=true;

char c;

int main()

{

	while((c=getchar())!=EOF)

	{

		if(x&1) putchar(c);

		x^=1;

	}

	putchar('\n');

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

string s;

    int i;

    cin >> s;

    for (i = 0; i < s.length(); i+=2){ 

        cout << s[i]; 

    }

    cout << endl; 

    return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 5.393860331862494x):
#include<stdio.h>

bool x=true;

char c;

int main()

{

	while((c=getchar())!=EOF)

	{

		if(x&1) putchar(c);

		x^=1;

	}

	putchar('\n');

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

char s[100001];

int main(){

	cin>>s;

	int len=strlen(s);

	for(int i=0;i<len;i+=2){

		cout<<s[i];

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.375795358528394x):
#include<stdio.h>

bool x=true;

char c;

int main()

{

	while((c=getchar())!=EOF)

	{

		if(x&1) putchar(c);

		x^=1;

	}

	putchar('\n');

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int main(){

    int i=0;

    char ch;

    while(cin>>ch){

        i++;

        if(i%2!=0)cout<<ch;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.34393825811288x):
#include <cstdio>

#include <cstring>

char c[100010];

int main()

{

	scanf("%s",c);

	int len=strlen(c);

	for(int i=0; i<len; i+=2) putchar(c[i]);

	putchar('\n');

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int main(){

    int i=0;

    char ch;

    while(cin>>ch){

        i++;

        if(i%2!=0)cout<<ch;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.328305789155333x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

    int i=1;

    char x;

    while (cin>>x){

        if (i%2) cout<<x;

        i++;

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.328364324598544x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

char c[100001];

int la=0;

int main() 

{

    scanf("%s",&c);

    int la=strlen(c);

    for(int i=0;i<la;i+=2)

    {

    cout<<c[i];

    }

	cout<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.350460703956245x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

char a[100005];int l,i;

int main(){

	scanf("%s",a);

	l=strlen(a);

	for(;i<l;i++)

		if(i%2==0)

			printf("%c",a[i]);

	printf("\n");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.288657782287175x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string s;

    cin>>s;

    for(int i=0;i<s.length();i+=2) cout<<s[i];

    cout<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3463467129346816x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstring>

using namespace std;

int main()

{

	string s;

	cin>>s;

	int n=s.length();

	for(int i=0;i<n;i++)

	{

		if((i+1)%2==1)

		{

			cout<<s[i];

		}

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.326926453967878x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<iostream>

using namespace std;

string s;

int main()

{

  cin>>s;

  for(int i=0;i<s.size();i++)

    if(!(i&1))  printf("%c",s[i]);

  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.326948967599882x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

string c;

int main()

{

    cin>>c;

    for (int i=0;i<c.size();i++)

    {

    if ((i+1)%2!=0) cout<<c[i];    

    }

    cout<<endl;

  

} 

// Faster C++ solution for the same problem (measured speedup: 5.34816581440062x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

int main(){

	string str;

	cin>>str;

	for(int i = 0;i<str.size();i+=2){

		printf("%c",str[i]);

	}

	printf("\n");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.326894934883072x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
  #include<iostream>

#include<string>

using namespace std;



int main(){

    string a;

    getline(cin,a);

    for (int i = 0;i<=a.length()-1;i+=2){

        cout << a[i];

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.363071339696186x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string s;

int main(){

    ios::sync_with_stdio(false);

    cin >> s;

    for(int i = 0; i < (int)s.size(); i += 2){

        cout << s[i];

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.4119379284156555x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
// luogu-judger-enable-o2

#include <iostream>

using namespace std;

int main(){

    string a;

    cin >> a;

    for(int i=0;i<a.length();i+=2){

        cout << a[i];

    }

    cout << endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3463467129346816x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
// luogu-judger-enable-o2

#include<iostream>

#include<cstring>

using namespace std;

int main(){

	char a[100860];

	cin>>a;

	for(int i=0;i<strlen(a);i+=2) cout<<a[i];

	cout<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.347041633709211x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

string s;

int len,i;

int main()

{

	cin>>s;

	len=s.length();

	for(i=0;i<len;i++) if((i)%2==0) cout<<s[i];

	cout<<endl;

	return 0;

} 

// Faster C++ solution for the same problem (measured speedup: 5.346331703846679x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	int len;

	string s;

	cin>>s;

	if(s.size()%2==0)len=s.size()-1;

	else len=s.size();

	for(int i=0;i<=len;i=i+2)

	{

		cout<<s[i];

	}

}


// Faster C++ solution for the same problem (measured speedup: 5.327124573929514x):
#include<cstring>

#include<cstdio>

using namespace std;

char s[666233];

int main(void){

	scanf("%s",s);

	for(int i=0;i<strlen(s);i+=2) putchar(s[i]);

	puts("");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<bits/stdc++.h>

char a[200000];

int main()

{

    int i,n,m,j,k,l;

    scanf("%s",a);

    for(i=0;i<strlen(a);i++)

    {

        if((i+1)%2==1)

        {

            printf("%c",a[i]);

        }

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.227292020373515x):
#pragma GCC optimize(2)

#include <cstdio>

#include <cstring>

using namespace std;



char a[110000];



int main()

{

	scanf("%s",a);

	int l=strlen(a);

	for(int i=0;i<l;i+=2) printf("%c",a[i]);

	printf("\n");

	return 0;

}
// Slower C++ solution:
/*

Character Drawing Adapted from FAKEUPDATE.NET

		   _    _____         _

		   \`,""   ,'7"r-..__/ \

		  ,'\ `, ,',','    _/   \

		 /   \, 7 / /     (   \ |

		J     \/ j  L______\  / |

		L   __JF"""/""\"\_,    /

		L,-"| O|  f O |  L_  _/

		F   \_ /  \__/   `-  j|

			.-'    `"""    ,' |          _..====.._

			\__/         r"_  A        ,' _..---.._`,

			 `-.______,,-L// / \  ___,' ,'_..:::.. `,`,

					  j   / / / 7"    `-<""=:'  '':. \ \

					 /   <,' /  F  . i , \   `,    :T W I

					 |    \,'  /    >X<  |     \   :| | L

					 |     `._/    ' ! ` |      I  :| |  G

					  \           \     /       |  :H T  |

					 __>-.__   __,-\   |        |  S P   |

					/     /|   | \  \  \_       | 'A R   |

				   /   __/ |   |  L  L   \      K./ /    L

				  /   |    |   4  I  I    |    E./ /   ,'

				 J    \    I    L F  I    |    // / _,'

		_________|     |   F    |J   F    |   //_/-'

		\   __   |    /   J     |/  J     |  /="

		\\  \_\  \__,' \  F     |   F     |

		\\\_____________\/      F__/      F

		 \\| 计算机编程 |_____/  (______/

		  \/从入门到入土/

*/

#include <iostream>

#include <cstdlib>

#include <iomanip>

#include <cmath>

#include <string>

#include <cstring>

#include <algorithm>

#include <vector>

#include <sstream>

#include <set>

#include <queue>

#include <stack>

#include <cctype>

#include <map>

#include <climits>

#include <bitset>

#include <functional>

using namespace std;

#define MATH_PI 3.14159265358979323846

int main(){

	ios::sync_with_stdio(false);

	string sInput;

	int i;

	cin >> sInput;

	for (i = 1; i <= sInput.length(); ++i){

		if (i % 2 != 0)

			cout << sInput[i - 1];

	}

	cout << endl;

endapp:

	//system("pause > nul");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.404646075486483x):
#pragma GCC optimize(2)

#include <cstdio>

#include <cstring>

using namespace std;



char a[110000];



int main()

{

	scanf("%s",a);

	int l=strlen(a);

	for(int i=0;i<l;i+=2) printf("%c",a[i]);

	printf("\n");

	return 0;

}
// Slower C++ solution:
#include<cstring>

#include<iostream>

#include<cstdio>

using namespace std;

int main()

{

    char c;

    int i=0;

    while(scanf("%c",&c)!=EOF)

    {

        if(i%2==0)cout<<c;

        i++;

    }

    cout<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.286351170052359x):
#pragma GCC optimize(2)

#include <cstdio>

#include <cstring>

using namespace std;



char a[110000];



int main()

{

	scanf("%s",a);

	int l=strlen(a);

	for(int i=0;i<l;i+=2) printf("%c",a[i]);

	printf("\n");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

string s;

unsigned int i = 1;

int main() {

    cin >> s;

    for (; i <= s.length(); ++i) {

        if (i & 1) {

            putchar(s[i - 1]);

        }

    }

    puts("");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.259294822325383x):
#pragma GCC optimize(2)

#include <cstdio>

#include <cstring>

using namespace std;



char a[110000];



int main()

{

	scanf("%s",a);

	int l=strlen(a);

	for(int i=0;i<l;i+=2) printf("%c",a[i]);

	printf("\n");

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std; //头文件和命名空间

int main(){

    ios::sync_with_stdio(false); //输入输出加速

    string sInput; //输入的字符串

    int i; //循环计数器

    cin >> sInput; //读入

    for (i = 0; i < sInput.length(); i+=2){ //枚举奇数位置，注意由于string中第一个字符的索引号为0，因此题目的奇数位事实上是字符串中索引号为偶数的位置

        cout << sInput[i]; //输出对应位置的字符，注意string中第一个字符的索引号为0

    }

    cout << endl; //换行

    return 0; //结束

}

// Faster C++ solution for the same problem (measured speedup: 1.1017010524303363x):
#include<cstdio>

#include<string>

using namespace std;

char a[100005];

string s;

int main(){

    

    scanf("%s",&a);

    s=a;

    for (int i=0;i<=s.size()-1;i+=2)

	{

       printf("%c",s[i]);

    }

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std; 

int main()

{

    ios::sync_with_stdio(false); 

    string a;  

    cin>>a; 

    for(register int i=0;i<a.length();i+=2)

	{ 

        cout<<a[i];

    }

    cout<<endl; 

    return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 1.1017010524303363x):
#include<cstdio>

#include<string>

using namespace std;

char a[100005];

string s;

int main(){

    

    scanf("%s",&a);

    s=a;

    for (int i=0;i<=s.size()-1;i+=2)

	{

       printf("%c",s[i]);

    }

    return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<string.h>

#include<algorithm>

#include<math.h>

#include<vector>

using namespace std;

#define N 100010

#define LL long long

int a[N];

vector<LL> q;

int main()

{

    int i,j,k,n,m;

    int x,y,z;

    LL d,t,s;

    scanf("%d%d",&n,&m);

    for(i=1;i<=n;i++)

        scanf("%d",&a[i]);

    for(i=1;i<=n;i++)

    {

        d=0;

        for(j=i;j<=n;j++)

        {

            d=d+a[j];

            q.push_back(d);

        }

    }

    s=0;

    for(i=40;i>=0;i--)

    {

        d=s|(LL)pow(2,i);

        k=0;

        for(j=0;j<n*(n+1)/2;j++)

        if((q[j]&d)==d)

            k++;

        if(k>=m)

            s=s+(LL)pow(2,i);

    }

    printf("%lld\n",s);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 4.79454498265939x):
#include<stdio.h>

#include<string.h>

#include<algorithm>

#include<vector>

#include<math.h>

using namespace std;

#define N 1000010

#define LL long long

int a[N],vis[N];

LL s[N],b[N],c[N],p[N];

int main()

{

    int i,j,k,n,m;

    int x,y,z;

    LL d,t,ans;

    scanf("%d%d",&n,&m);

    p[0]=1;

    for(i=1;i<=50;i++)

        p[i]=p[i-1]*2;

    for(i=1;i<=n;i++)

        scanf("%d",&a[i]);

    s[0]=0;

    for(i=1;i<=n;i++)

        s[i]=s[i-1]+a[i];

    k=0;

    for(i=1;i<=n;i++)

    for(j=i;j<=n;j++)

    {

        d=s[j]-s[i-1];

        b[k++]=d;

    }

    ans=0;

    y=40;

    while(1)

    {

        for(i=y;i>=0;i--)

        {

            z=0;

            d=ans+p[i];

            for(j=0;j<k;j++)

            if((b[j]&d)==d)

                z++;

            if(z>=m)

                break;

        }

        if(i<0)

            break;

        ans=ans+p[i];

        y=i-1;

    }

    printf("%lld\n",ans);

    return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<string.h>

#include<algorithm>

#include<math.h>

#include<vector>

using namespace std;

#define N 100010

#define LL long long

int a[N];

LL b[N];

vector<LL> q;

int main()

{

    int i,j,k,n,m;

    int x,y,z;

    LL d,t,s;

    scanf("%d%d",&n,&m);

    b[0]=0;

    for(i=1;i<=n;i++)

    {

        scanf("%d",&a[i]);

        b[i]=b[i-1]+a[i];

    }

    for(i=1;i<=n;i++)

    {

        for(j=i;j<=n;j++)

        {

            d=b[j]-b[i-1];

            q.push_back(d);

        }

    }

    s=0;

    for(i=40;i>=0;i--)

    {

        d=s|(LL)pow(2,i);

        k=0;

        for(j=0;j<n*(n+1)/2;j++)

        if((q[j]&d)==d)

            k++;

        if(k>=m)

            s=s+(LL)pow(2,i);

    }

    printf("%lld\n",s);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 4.79704279270865x):
#include<stdio.h>

#include<string.h>

#include<algorithm>

#include<vector>

#include<math.h>

using namespace std;

#define N 1000010

#define LL long long

int a[N],vis[N];

LL s[N],b[N],c[N],p[N];

int main()

{

    int i,j,k,n,m;

    int x,y,z;

    LL d,t,ans;

    scanf("%d%d",&n,&m);

    p[0]=1;

    for(i=1;i<=50;i++)

        p[i]=p[i-1]*2;

    for(i=1;i<=n;i++)

        scanf("%d",&a[i]);

    s[0]=0;

    for(i=1;i<=n;i++)

        s[i]=s[i-1]+a[i];

    k=0;

    for(i=1;i<=n;i++)

    for(j=i;j<=n;j++)

    {

        d=s[j]-s[i-1];

        b[k++]=d;

    }

    ans=0;

    y=40;

    while(1)

    {

        for(i=y;i>=0;i--)

        {

            z=0;

            d=ans+p[i];

            for(j=0;j<k;j++)

            if((b[j]&d)==d)

                z++;

            if(z>=m)

                break;

        }

        if(i<0)

            break;

        ans=ans+p[i];

        y=i-1;

    }

    printf("%lld\n",ans);

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.244811952293794x):
#include <stdio.h>



int main(){

    int a,b,c;

    scanf("%d %d %d", &a, &b, &c);

    int count = 0;



    for (int i=a; i<=b; i++){

        if (i%c == 0){

            count++;

        }

    }

    printf("%d\n", count);





    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.244811952293794x):
#include <stdio.h>



int main(){

	

	int inp1, inp2, inp3, o=0;

	

	scanf("%d %d %d", &inp1, &inp2, &inp3);

	for(int i=inp1; i<=inp2; i++){

		if(i%inp3==0){

			o++;

		}

	}

	printf("%d\n", o);

	

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.244398955856614x):
#include<stdio.h>



int main(){

	int l,r,n,x=0;

	scanf("%d%d%d", &l, &r, &n);

	for (int i=l ; i<=r ; i++){

		if (i%n==0){

			x++;

		}

	}

	printf("%d\n", x);

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.255644012936023x):
#include <stdio.h>

#include <string.h>



int main () {

	int a,b,c,d ;

	d=0;

	scanf ("%d %d %d",&a,&b,&c);

	for (int i =a ; i<=b;i++)

	if (i%c == 0) {

		d++;

	}

	printf("%d",d);



	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.244808551055007x):
#include <stdio.h>



int main()

{

    int L, R, d;



    scanf("%d%d%d", &L, &R, &d);



    int num = 0;

    for (int i = L; i <= R; i++)

    {

        if (i % d == 0)

        {

            num++;

        }

    }



    printf("%d\n", num);



    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.255644012936023x):
#include <stdio.h>



int main(){

	int L, R, D;

	scanf("%d %d %d", &L, &R, &D);

	int c = 0;

	for (int i = L; i <= R; i++){

		if (i%D==0){

		c++;

		}

	}

	printf("%d", c);

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.269451144318768x):
#include <stdio.h>



int main(){

	int a,b,c;

	scanf("%d %d %d", &a,&b, &c);

	

	int sum;

	sum = ((b/c*c-(a+c-1)/c*c)/c+1);

	

	printf("%d", sum);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.244811952293794x):
#include <stdio.h>



int main() {

	int X, Y, Z;

	

	scanf("%d %d %d", &X, &Y, &Z);

	

	int num = 0;

	for(int i = X; i <= Y; i++){

		if(i % Z == 0) {

			num++;

		}

	} 

	printf("%d\n", num);

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.244811952293794x):
#include <stdio.h>



int main() {

    int l, r, d, count = 0;

    scanf("%d %d %d", &l, &r, &d);



    for(int i = l; i <= r; i++) {

        if(i % d == 0) {

            count++;

        }

    }

    printf("%d\n", count);



    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.255644012936023x):
#include <stdio.h>



int main(){

    int l;

    int r;

    int d;

    int a=0;

    scanf("%d %d %d", &l,&r,&d);



    for (int i =l; i <= r; i++){

        if(i%d==0){

        a = a+1;

        }

    }

    printf("%d", a);

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.242633105988897x):
#include <stdio.h>



int main(){

	int L, R, d, ctr = 0;

	scanf("%d %d %d", &L, &R, &d, &ctr);

	

	while(L <= R){

		if(L % d == 0){

			ctr += 1;

		}

		L++;

	}

	printf("%d\n", ctr);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int l,r,d; cin >> l >> r >> d;

	cout << r/d - (l-1)/d << "\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.242633105988897x):
#include <stdio.h>



int main () {

	int l, r, d, tot = 0;

	scanf("%d %d %d", &l, &r, &d, &tot);

	while (l <= r ) {

		if (l % d == 0) {

			tot = tot + 1;

		}

		l++;

	}

	printf("%d\n", tot);

	return 0;	

}