DetegiCE

#include<stdio.h>

int main()
{
  int t;
  char nums[63];

  char ans[63];
  int acnt = 0;
  

DetegiCE

#include<stdio.h>
#define ll long long int

int isPrime(ll n) {
  for(ll i=2 ; i*i<=n ; i++) {
    if(n%i==0) return 0;
  }
  return 1;
}

DetegiCE

#include<stdio.h>
#define ll long long int

ll gcd(ll a, ll b) {
  return b?gcd(b,a%b):a;
}

int main()
{
  int t;

DetegiCE

#include<cstdio>
#include<cstdlib>
#include<queue>
#include<utility>
using namespace std;

typedef struct node {
    int ze;
    int on;
} NOD;

DetegiCE

#include<stdio.h>

int prs[100000];

int main()
{
  int t;
  scanf("%d",&t);
  int pcur = 4;
  prs[0]=2,prs[1]=3,prs[2]=5,prs[3]=7;

DetegiCE

#include<stdio.h>

int prs[100000];

int main()
{
  int t;
  scanf("%d",&t);
  int pcur = 4;
  prs[0]=2,prs[1]=3,prs[2]=5,prs[3]=7;

DetegiCE

#include<stdio.h>
#define ll long long int

int main()
{
  int t;
  scanf("%d",&t);
  while(t--) {
    ll a,n,b;
    scanf("%lld %lld %lld",&a,&n,&b);

DetegiCE

#include<stdio.h>

int main()
{
  int n;
  scanf("%d",&n);
  for(int i=0 ; i<n ; i++) {
    for(int j=n-i-1 ; j>=1 ; j--) printf(" ");
    for(int j=1 ; j<=i*2+1 ; j++)
      printf("*");

DetegiCE

for(int i=a ; i<b ; i++)
    if(i%n==0)

DetegiCE

#include<stdio.h>
#define ll long long int

int main()
{
  int t;
  scanf("%d",&t);
  while(t--) {
    ll x;
    scanf("%lld",&x);