CCCPaste

NCTU LAB 04/12 Num 3

#include <stdio.h>
#include <stdlib.h>

int gcd(int a, int b){
if(a==0){

Scilab, tp6 rk4 function

function [X] = rk4(a, t0, T, N, f)
p = size (a, 1);
X = zeros (p, N);

t = t0;

Scilab, tp6 pointmilieu function

function [X] = pointmilieu(a, t0, T, N, f)
p = size (a, 1);
X = zeros (p, N);

h = T / N;

Scilab, tp6 tracevdp function

function tracevpd(a, t0, T, Neuler, Nptmil, Nrk4, Node)
// Approximation euler
u = euler(a, t0, T, Neuler, vdp);

// Approximation point milieu

Scilab, euler function

function [X] = euler(a, t0, T, N, f)
p = size (a, 1);
X = zeros (p, N);

h = T / N;

Dijkstra with paths

#include <iostream>
#include <limits.h>
using namespace std;

#define FOR(i, x, v) for(int i=x;i<v;i++)

Scilab, tracerk4 function

function traceRK4(a, t0, T, Nrk4, Node)
// Approximation RK4
u = RK4(a, t0, T, Nrk4, vdp);

// Approximation ODE

Jo Number

#include <stdio.h>

int n = 500000000, i;
int arr[100000];

Good

#include <stdio.h>
#include <string.h>

bool check(char in[]){
for(int i=0;i<=strlen(in);i++){

Tiles

#include <stdio.h>
#include <string.h>
int count, now, n, m;
char in[101];