1
2
3
4
5
6
7
8
9
#include<stdio.h>
#include<math.h>
int main()
{
    char a[501];
    int b[500];
    int z[11]={1,1,2,6,24,120,720,5040,40320,362800,3628000};
    int prime[95]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,
        73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<string.h>
using namespace std;
 
bool isMatching(char *str, char *reg, int n, int m, int i, int j) {
        cout<<"FD "<<i<<" "<<str[i]<<" "<<j<<" "<<reg[j]<<endl;
        if(i==n&&j==m) return true;
        if(i>=n||j>=m) return false;
        if(reg[j]<'a'||reg[j]>'z') return false;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int i,j,n;
scanf("%d",&n);
for(i=1;i<n;i++)
{
for(j=0;j<(n-1-i)*2;j++)
printf(" ");
 ...

1
2
3
4
5
6
7
8
9
/* Abreu, Dianne
 * Apo, Andrea
 * Gardose, Zanetha
 * Manuel, Jezariel
 * Ouano, Genisha
 * Padan, Rheiva
 * Sepian, Rogelyn
 * Tupaen, Vivien
 * Faypon, Jeremy
 ...

1
2
3
4
5
6
7
8
9
#include <iostream>
#include <math.h>
#include <stdlib.h>
 
using namespace std;
 
int Pierwsza(int p)
{
  int i = 2;    
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int i,j,n;
scanf("%d",&n);
for(i=1;i<n;i++)
{
for(j=0;j<(n-1-i)*2;j++)
printf(" ");
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int i=0;
 
while(i<4)
{
int j=6;
while(j>0)
 ...

1
2
3
4
5
6
7
8
9
/* Abreu, Dianne
 * Apo, Andrea
 * Gardose, Zanetha
 * Manuel, Jezariel
 * Ouano, Genisha
 * Padan, Rheiva
 * Sepian, Rogelyn
 * Tupaen, Vivien
 * Faypon, Jeremy
 ...

1
2
3
4
5
6
7
8
9
class calDifference{
 
        public static void main(String k[]){
        
        int n, sumOfSq, sqOfSums, diff;
        int[] num; 
        int[] numSq;    
 
        Scanner sc=new Scanner(System.in);
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<string.h>
using namespace std;
 
bool isMatching(char *str, char *reg, int n, int m, int i, int j) {
        if(i==n&&j==m) return true;
        if(i>=n||j>=m) return false;
        if(reg[j]<'a'||reg[j]>'z') return false;
        if(j+1>=m&&reg[j]==str[i]) return true;
 ...

1
2
3
4
5
6
7
8
#!/bin/sh
# script :- bdayscript.sh -- send Birthday mails
#
 
# to run in a cron job need to do this
 
# crontab -e
# 0 0 * * * /root/home/bdayscript.sh
 ...

1
2
3
4
5
6
7
8
9
/* Abreu, Dianne
 * Apo, Andrea
 * Gardose, Zanetha
 * Manuel, Jezariel
 * Ouano, Genisha
 * Padan, Rheiva
 * Sepian, Rogelyn
 * Tupaen, Vivien
 * Faypon, Jeremy
 ...

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

1
2
3
4
5
6
7
8
9
/* Abreu, Dianne
 * Apo, Andrea
 * Gardose, Zanetha
 * Manuel, Jezariel
 * Ouano, Genisha
 * Padan, Rheiva
 * Sepian, Rogelyn
 * Tupaen, Vivien
 * Faypon, Jeremy
 ...

1
2
3
4
5
6
7
8
9
import java.lang.*;
 
class calDifference{
 
        public static void main(String k[]){
        
        int n, sumOfSq, sqOfSums, diff;
        int[] num; 
        int[] numSq;    
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
main()
{
int n,i=n;
 
while(i--)
{printf("%d",i);
}
}

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<(n-1-i)*2;j++)
printf(" ");
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int i=0;
int j=6;
while(i<4)
{while(j>0)
{
printf("");
 ...

1
2
3
4
5
6
7
8
9
/* Abreu, Dianne
 * Apo, Andrea
 * Gardose, Zanetha
 * Manuel, Jezariel
 * Ouano, Genisha
 * Padan, Rheiva
 * Sepian, Rogelyn
 * Tupaen, Vivien
 * Faypon, Jeremy
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
main()
{
int n,i=n;
 
while(i--)
{printf("%d",i)
}
}

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<string.h>
using namespace std;
 
bool isMatching(char *str, char *reg, int n, int m, int i, int j) {
        if(i==n&&j==m) return true;
        if(i>=n||j>=m) return false;
        if(reg[j]<'a'||reg[j]>'z') return false;
        if(j+1>=m&&reg[j]==str[i]) return true;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<string.h>
using namespace std;
 
bool isMatching(char *str, char *reg, int n, int m, int i, int j) {
        if(i==n&&j==m) return true;
        if(i>=n||j>=m) return false;
        if(reg[j]<'a'||reg[j]>'z') return false;
        if(j+1>=m&&reg[j]==str[i]) return true;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<string.h>
using namespace std;
 
bool isMatching(char *str, char *reg, int n, int m, int i, int j) {
        if(i==n&&j==m) return true;
        if(i>=n||j>=m) return false;
        if(reg[j]<'a'||reg[j]>'z') return false;
        if(j+1>=m&&reg[j]==str[i]) return true;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int i=0;
int j=6;
while(i<4)
{while(j>0)
{
printf("");
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
int main()
{
int i=0;
int j=6;
while(i<4)
{while(j>0)
{
printf("");
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<string.h>
using namespace std;
 
bool isMatching(char *str, char *reg, int n, int m, int i, int j) {
        if(i==n&&j==m) return true;
        if(i>=n||j>=m) return false;
        if(reg[j]<'a'||reg[j]>'z') return false;
        if(j+1>=m&&reg[j]==str[i]) return true;
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<string.h>
using namespace std;
 
bool isMatching(char *str, char *reg, int n, int m, int i, int j) {
        if(i==n&&j==m) return true;
        if(i>=n||j>=m) return false;
        if(reg[j]<'a'||reg[j]>'z') return false;
        if(j+1>=m&&reg[j]==str[i]) return true;
 ...

1
2
3
4
5
6
7
8
9
/* Bismillahir Rahmanir Rahim */
/*Coder: Ahmad Faiyaz*/
 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
 ...

1
2
3
4
5
6
7
8
9
#include<iostream>
#include<string.h>
using namespace std;
 
bool isMatching(char *str, char *reg, int n, int m, int i, int j) {
        if(i==n&&j==m) return true;
        if(i>=n||j>=m) return false;
        if(reg[j]<'a'||reg>'z') return false;
        if(j+1>=m&&reg[j]==str[i]) return true;
 ...

1
2
3
4
5
6
7
8
9
#include<stdio.h>
main()
{
int  n,sign,i=n;
float sum;
while(i--)
{
sign=(-1);
sum=(sum+(i)*sign);
 ...