Joemmanuel Ponce joemmanuel
- Redmond, Washington
- Sign in to view email
- http://www.omegaup.org
View plantas-vs-plantas-charlyhlms.cpp
#include <iostream> | |
#include <stdio.h> | |
using namespace std; | |
int A[1000002]; | |
int pila[1000002]; | |
int cuantos[1000002]; | |
int n; | |
int fin; |
View bety-sleepensarethebest.cpp
#include <iostream> | |
#include <cstdio> | |
using namespace std; | |
int height, width, movs, opnum, opin; | |
int ops[10], board[105][105], nboard[105][105]; | |
void adjust() | |
{ |
View subprimos-diego_futbolm.cpp
#include <cstdlib> | |
#include <iostream> | |
#include <string.h> | |
using namespace std; | |
bool esprimo[100005]; | |
int fact[100005], n; | |
bool es_primo(int n) | |
{ | |
int si; | |
si = 1; |
View supernievesbros-bfs.cpp
#include <iostream> | |
#include <cstdio> | |
#include <queue> | |
using namespace std; | |
struct coord | |
{ | |
int x, y; | |
}np; |
View supernieves-bt.cpp
#include <iostream> | |
using namespace std; | |
int vis[102][102]; | |
int color; | |
int n, m; | |
int xf, yf; | |
char mapa[102][102]; |
View conciertolira.cpp
#include <iostream> | |
#include <cstdio> | |
using namespace std; | |
int songs, iniv, maxim; | |
int slist[55], dp[50005][55]; | |
int main() | |
{ |
View patos.cpp
#include <algorithm> | |
#include <stdio.h> | |
using namespace std; | |
int arr[50]; | |
int n,i,a,b,c; | |
int main() | |
{ | |
scanf("%d",&n); | |
for (i=0;i<n;i++) | |
{ |
View bisiesto.cpp
#include<stdio.h> | |
int main(){ | |
int year,casos; | |
scanf("%ld",&casos); | |
while(casos>0){ | |
scanf("%ld",&year); | |
if (((year % 4)==0) && ((year % 100)!=0 || (year % 400)==0)) | |
printf("S\n"); | |
else | |
printf("N\n"); |
View amayusculas.cpp
#include <stdio.h> | |
#include <ctype.h> | |
int main () | |
{ | |
int i=0; | |
char str[500],c; | |
gets(str); | |
while (str[i]) | |
{ | |
c=str[i]; |
View sumas-64.cpp
#include <stdio.h> | |
int main() | |
{ | |
long long a,b; | |
long long c; | |
scanf("%lld %lld", &a,&b); | |
c = a+b; | |
printf("%lld", c); | |
} |
NewerOlder