# 如何在不使用循环的情况下打印1到100之间的数字？|S2

2021年4月13日09:51:43 发表评论 798 次浏览

## C ++

``````#include <iostream>
using namespace std;

int main()
{
int i = 0;

begin:
i = i + 1;
cout <<i <<" " ;

if (i <100)
{
goto begin;
}
return 0;
}

//This code is contributed by ShubhamCoder``````

## C

``````#include <stdio.h>

int main()
{
int i = 0;
begin:
i = i + 1;
printf ( "%d " , i);

if (i <100)
goto begin;
return 0;
}``````

## C#

``````using System;

class GFG{

static public void Main ()
{
int i = 0;
begin:
i = i + 1;
Console.Write( " " + i + " " );

if (i <100)
{
goto begin;
}
}
}

//This code is contributed by ShubhamCoder``````

``1 2 3 4 . . . 97 98 99 100``

## C ++

``````#include <iostream>
using namespace std;

int main()
{
static int i = 1;

if (i <= 100)
{
cout <<i++ <<" " ;
main();
}
return 0;
}

//This code is contributed by ShubhamCoder``````

## C

``````#include <stdio.h>

int main()
{
static int i = 1;
if (i <= 100) {
printf ( "%d " , i++);
main();
}
return 0;
}``````

## Java

``````//Java program to count all pairs from both the
//linked lists whose product is equal to
//a given value
class GFG
{
static int i = 1 ;

public static void main(String[] args)
{

if (i <= 100 )
{
System.out.printf( "%d " , i++);
main( null );
}
}
}

//This code is contributed by Rajput-Ji``````

## C#

``````//C# program to count all pairs from both the
//linked lists whose product is equal to
//a given value
using System;

class GFG
{
static int i = 1;

public static void Main(String[] args)
{
if (i <= 100)
{
Console.Write( "{0} " , i++);
Main( null );
}
}
}

//This code is contributed by Rajput-Ji``````

``1 2 3 4 . . . 97 98 99 100``