1
2
3
4
5
6
7
8
9
#include <stdio.h>
 
typedef unsigned int Uint;
#define N 100
#define DP 15
//RADIX == 10^LOG
#define LOG 1
#define RADIX 10
typedef Uint Liczba[N+1];
 ...

1
2
3
4
5
6
7
8
9
#include <stdlib.h> 
 
 
int main (int argc, char ** argv) {
 setenv("PATH", "foo", 1);
 system("echo $PATH");
 
 return EXIT_SUCCESS;
}

1
2
3
4
5
6
7
8
9
#include <stdio.h>
 
typedef unsigned int Uint;
#define N 100
#define DP 15
//RADIX == 10^LOG
#define LOG 1
#define RADIX 10
typedef Uint Liczba[N+1];
 ...

1
2
3
4
5
a=int(raw_input())
b=int(raw_input())
c=int(raw_input())
 
print (int(c*b/(a-b)))

1
2
3
4
5
a=int(raw_input())
b=int(raw_input())
c=int(raw_input())
 
print (int(c*b/(a-b)))

1
2
3
4
5
6
7
8
9
# define max 1000
char arr[max];
void subtract(char *a1,char *b1)
{
      int l1,l2;
        char temp[max],a[max],b[max];
        int c=0,sub=0,m=0;
        int i,j,k=0;
 
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h>
 
typedef unsigned int Uint;
#define N 100
#define DP 15
//RADIX == 10^LOG
#define LOG 1
#define RADIX 10
typedef Uint Liczba[N+1];
 ...

1
2
3
4
5
a=int(input())
b=int(input())
c=int(input())
 
print (int(c*b/(a-b)))

1
2
3
4
5
6
7
8
9
# define max 1000
char arr[max];
void subtract(char *a1,char *b1)
{
      int l1,l2;
        char temp[max],a[max],b[max];
        int c=0,sub=0,m=0;
        int i,j,k=0;
 
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h>
int main()
{
    int t,i,count;
    char str[100005],str1[100000];
    scanf("%d",&t);
    while(t--)
    {
              scanf("%s",str);
 ...

1
2
3
4
5
a=int(input())
b=int(input())
c=int(input())
 
print (int(c*b/(a-b)))

1
2
3
4
5
6
7
8
9
#include <iostream>
 
using namespace std;
 
bool check(unsigned);
 
int main(int argc , char * argv[]) {
  unsigned num;
  while (cin >> num) {
 ...

1
2
3
4
5
6
7
8
9
# define max 1000
char arr[max];
void subtract(char *a1,char *b1)
{
      int l1,l2;
        char temp[max],a[max],b[max];
        int c=0,sub=0,m=0;
        int i,j,k=0;
 
 ...

1
2
3
4
5
6
7
8
9
# define max 1000
char arr[max];
void subtract(char *a1,char *b1)
{
      int l1,l2;
        char temp[max],a[max],b[max];
        int c=0,sub=0,m=0;
        int i,j,k=0;
 
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h>
 
typedef unsigned int Uint;
#define N 100
#define DP 5
//RADIX == 10^LOG
#define LOG 1
#define RADIX 10
typedef Uint Liczba[N+1];
 ...

1
2
3
4
5
int main() {
  int i = 1; 
 printf("Hello world %d, %d\n", ++i, i++);
 return 0;
}

1
2
3
4
5
6
7
8
9
# define max 1000
char arr[max];
char* sub(char *a1,char *b1)
{
      int l1,l2;
        char temp[max],a[max],b[max];
        int c=0,sub=0,m=0;
        int i,j,k=0;
 
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h>
 
typedef unsigned int Uint;
#define N 100
#define DP 5
//RADIX == 10^LOG
#define LOG 1
#define RADIX 10
typedef Uint Liczba[N+1];
 ...

1
2
3
4
int main() {
  int i = 1; 
 printf("Hello world %d, %d\n", ++i, i++);
}

1
2
3
4
5
6
7
8
9
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
 
#define FieldSize 20
#define TimeMax 20
 
/*フィールドの初期化 (ファイルの読み込み)*/
void init_field(int field[FieldSize][FieldSize], char *fname)
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
 
using namespace std;
 
int main() {
while (1)
        {cout<<"Люблю тебя моя прелесть!";
cout<<endl;}
        return 0;

1
2
3
4
5
6
7
8
9
# define max 1000
char arr[max];
char *sub(char *a1,char *b1)
{
      int l1,l2;
        char temp[max],a[max],b[max];
        int c=0,sub=0,m=0;
        int i,j,k=0;
 
 ...

1
2
3
4
5
6
7
8
9
/* Recursive definition of determinate using expansion by minors.*/
#define NULL 0
double Determinant(double **a,int n)
{
int i,j,j1,j2 ; // general loop and matrix subscripts
double det = 0 ; // init determinant
double **m = NULL ; // pointer to pointers to implement 2D square array
 
if (n < 1) // error condition, should never get here
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
 
using namespace std;
 
int main() {
while (1)
        {cout<<"Люблю тебя моя прелесть!"<<endl;}
        return 0;
}

1
2
3
4
5
6
7
8
9
/* Recursive definition of determinate using expansion by minors.*/
double Determinant(double **a,int n)
{
int i,j,j1,j2 ; // general loop and matrix subscripts
double det = 0 ; // init determinant
double **m = NULL ; // pointer to pointers to implement 2D square array
 
if (n < 1) // error condition, should never get here
{
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <algorithm>
 
using namespace std;
 
int main( void )
{
    int N;
    int t = 0;
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h>
 
typedef unsigned int Uint;
#define N 100
#define DP 5
//RADIX == 10^LOG
#define LOG 1
#define RADIX 10
typedef Uint Liczba[N+1];
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <algorithm>
 
using namespace std;
 
int main( void )
{
    int N;
    int t = 0;
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <iomanip>
using namespace std;
 
int main()
{
   double number;
        cout << "enter a number\n";
        cin >> number;
 ...

1
2
3
4
5
6
7
8
9
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
 
#define FieldSize 20
#define TimeMax 20
 
/*フィールドの初期化 (ファイルの読み込み)*/
void init_field(int field[FieldSize][FieldSize], char *fname)
 ...